Papers with text classification
Copied to clipboard
| Challenge: | Experiments show that BERTweet outperforms strong baselines RoBERTa-base and XLM-R-base on three Tweet NLP tasks: Part-of-speech tagging, Named-entity recognition and text classification. |
| Approach: | They propose to train a pre-trained language model for English Tweets using the RoBERTa pre training procedure and use it to train the model. |
| Outcome: | Experiments show that the model outperforms baseline models on three Tweet NLP tasks: Part-of-speech tagging, Named-entity recognition and text classification. |
Copied to clipboard
| Challenge: | Large pre-trained language models have hundreds of millions of parameters and take several gigabytes of memory to train and inference. |
| Approach: | They propose an open-source knowledge distillation toolkit designed for natural language processing that provides a set of predefined distillation methods and can be extended with custom code. |
| Outcome: | The proposed method is comparable with or even higher than the public distilled BERT models with similar numbers of parameters. |
Copied to clipboard
| Challenge: | Existing spelling correction systems are far from perfect for noise-sensitive texts . a new way to handle noise is to make models robust to noise. |
| Approach: | They propose a robust to noise word embeddings model which outperforms existing models in different tasks. |
| Outcome: | The proposed model outperforms existing models in three downstream tasks and shows improvements in noise robustness over existing models. |
Copied to clipboard
| Challenge: | Existing studies have focused on text classification, but have shown that images do not improve NLP tasks. |
| Approach: | They focus on text classification, where images complement the text and the Wikipedia page can be in one of a number of different languages. |
| Outcome: | The proposed model trains without external pre-training, but when combined with BERT models pre-trained on large-scale external data, images contribute nothing. |
Copied to clipboard
| Challenge: | Natural Language Processing (NLP) relies on labeled data to perform state-of-the-art performance . labeles are often required to label large amounts of textual data . this tutorial will provide an overview of labeleing in NLP . |
| Approach: | This tutorial will provide a systematic overview of methods for learning from limited labeled data. |
| Outcome: | This tutorial will provide a systematic and up-to-date overview of the proposed methods . it will highlight current challenges and future directions . |
Copied to clipboard
| Challenge: | Recent advances in federated learning have demonstrated its promising capability to learn on decentralized datasets. |
| Approach: | They propose a technique that allows adversaries to poison the global model . they propose 'model poisoning' for backdoor attacks using word embeddings of NLP models . |
| Outcome: | The proposed technique improves the model poisoning performance in all experimental settings. |
Copied to clipboard
| Challenge: | Recent advances in text classification have shown that pre-trained representations are key for text classification. |
| Approach: | They propose a task alignment score that measures alignment at different levels of granularity. |
| Outcome: | The proposed score shows that task alignment can explain the performance of a given representation. |
Copied to clipboard
| Challenge: | Emotion stimulus detection is the task of finding the cause of an emotion in a textual description. |
| Approach: | They propose to evaluate whether clause classification or token sequence labeling is better for emotion stimulus detection in English. |
| Outcome: | The proposed framework compares clause classification and token sequence labeling on four English datasets. |
Copied to clipboard
| Challenge: | Recent research has focused on predicting crimes, predicting outcomes of judicial debates, and extracting information from legal documents. |
| Approach: | They propose to use a large-size Court Debate Dataset to analyze court debates . they invite experienced judges to design appropriate labels for data records . |
| Outcome: | The proposed dataset includes 30,481 court cases, totaling 1,144,425 utterances. |
Copied to clipboard
| Challenge: | BiomedCurator uses state-of-the-art natural language processing techniques to extract structured data from scientific articles. |
| Approach: | They propose a web application that extracts structured data from PubMed and ClinicalTrials.gov . the application uses a combination of natural language processing techniques and a pattern-based extraction approach . |
| Outcome: | The proposed system extracts the structured data from PubMed and ClinicalTrials.gov datasets. |
Copied to clipboard
| Challenge: | Large and complex models require many parameters and time to solve various problems in natural language processing. |
| Approach: | They propose to use the sinusoidal positional encoding (SPE) to construct a convolutional neural network using the SPE in text classification. |
| Outcome: | The proposed model reduces parameter size and training time while maintaining similar performance to the current model on multiple benchmark datasets. |
Copied to clipboard
| Challenge: | Existing approaches combine word embeddings with character-level features to model additional features such as subword structures and meaning ambiguity. |
| Approach: | They present FLAIR, an NLP framework that enables embeddings of word and document data . they propose a hierarchical learning architecture that concatenates output states of a character-level CNN or RNN with the output states from a task data. |
| Outcome: | The proposed framework hides embedding-specific engineering complexity and allows researchers to "mix and match" various embeddables with little effort. |
Copied to clipboard
| Challenge: | Existing solutions for information extraction (IE) require specialized models for different tasks or require expensive large language models. |
| Approach: | They propose a framework that enhances the original GLiNER architecture to support named entity recognition, text classification, and hierarchical structured data extraction within a single efficient model. |
| Outcome: | The proposed framework improves performance across diverse IE tasks and accessibility compared to LLM-based alternatives. |
Copied to clipboard
| Challenge: | Automatic emotion categorization is based on textual units assigned to an emotion from a predefined inventory, for instance following the basic emotion classes proposed by Paul Ekman (1999) or Plutchik (2001). |
| Approach: | They propose to make automatic emotion categorization explicit by following theories of cognitive appraisal of events and show their potential for emotion classification when being encoded in classification models. |
| Outcome: | The proposed models improve the classification of discrete emotion categories by using appraisal dimension assignments in event descriptions. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have significantly altered the landscape of Natural Language Processing (NLP), but their use as a baseline method has not been extensive. |
| Approach: | They propose a tool for automatic evaluation of RAG-based pipelines that provides a simple yet powerful abstraction. |
| Outcome: | The proposed tool provides an automatic evaluation of RAG-based pipelines. |
Copied to clipboard
| Challenge: | Embedding models are used in tasks such as information retrieval and semantic textual similarity. |
| Approach: | They propose a new Russian-focused embedding model called ru-en-RoSBERTa and a benchmark for Russian language . they propose to use the roMTEB benchmark to assess Russian and multilingual models . |
| Outcome: | The proposed model achieves results that are on par with state-of-the-art models in Russian. |
Copied to clipboard
| Challenge: | Increasing concerns and regulations about data privacy necessitate the study of privacy-preserving, decentralized learning methods for natural language processing tasks. |
| Approach: | They propose a framework for evaluating federated learning methods on four different tasks . they propose federation between Transformer-based language models and FL methods . |
| Outcome: | The proposed framework compares FL methods on four different tasks under non-IID partitioning strategies. |
Copied to clipboard
| Challenge: | Positive-unlabeled (PU) learning is a new approach to improve text classification by analyzing the impact of the online setting on fairness. |
| Approach: | They propose to extend Positive-Unlabeled (PU) learning to online learning by analyzing the impact of the online setting on fairness. |
| Outcome: | The proposed approach improves fairness in PU learning in both offline and online settings by using only labeled positive and unlabeled samples. |
Copied to clipboard
| Challenge: | Recent research points to knowledge distillation as a potential solution for NLU tasks. |
| Approach: | They propose a training approach that distills large finetuned LMs into a small network using unlabeled training examples. |
| Outcome: | The proposed approach outperforms BERT training approaches while using 300 times fewer parameters. |
Copied to clipboard
| Challenge: | Existing explanation methods conflate evidence for various features to predict a token . existing explanation methods are less interpretable for human understanding . |
| Approach: | They propose to explain language models contrastively by looking for salient input tokens that explain why the model predicted one token instead of another. |
| Outcome: | The proposed explanations are better than non-contrastive explanations for language models . they show that contrastive explanations improve simulability for human observers . |
Copied to clipboard
| Challenge: | a lack of standard evaluation metrics and benchmarks makes it difficult to identify strengths of Vietnamese NLP models. |
| Approach: | They propose to establish a standardized set of benchmarks for Vietnamese NLU . they propose to evaluate Vietnamese language understanding models using a pre-trained model . |
| Outcome: | The proposed model combines proficiency of a multilingual pre-trained model with Vietnamese linguistic knowledge. |
Copied to clipboard
| Challenge: | Natural language inference (NLI) is an actively studied topic serving as a proxy for natural language understanding. |
| Approach: | They propose to use a Romanian NLI corpus to analyze sentence pairs . they use multiple machine learning methods to establish competitive baselines . |
| Outcome: | The proposed model improves on the best model by employing a new curriculum learning strategy based on data cartography. |
Copied to clipboard
| Challenge: | Few-shot text classification systems are infeasible to deploy and use reliably due to their dependence on prompting and billion-parameter language models. |
| Approach: | They propose a modification to SetFit that fine-tunes a Sentence Transformer under a contrastive learning paradigm and achieves similar results to more unwieldy systems. |
| Outcome: | The proposed model fine-tunes a Sentence Transformer under a contrastive learning paradigm and achieves similar results to more unwieldy systems. |
Copied to clipboard
| Challenge: | Text classification is a fundamental problem in natural language processing, but its performance relies on high-quality annotations. |
| Approach: | They propose to use model-agnostic methods to handle inherent noise in large scale text classification that can be easily incorporated into existing machine learning workflows with minimal interruption. |
| Outcome: | The proposed method outperforms baselines by up to 10% in classification accuracy while requiring no network modifications. |
Copied to clipboard
| Challenge: | Existing methods for text augmentation perform data augmentation and downstream tasks separately. |
| Approach: | They propose a framework to perform text augmentation and the downstream task end-to-end. |
| Outcome: | The proposed framework performs text augmentation and the downstream task end-to-end on a text classification dataset. |
Copied to clipboard
| Challenge: | Existing methods to explain predictions by highlighting salient features are often unstated. |
| Approach: | They propose a framework to quantify the value of explanations via the accuracy gains that they confer on a student model trained to simulate a teacher model. |
| Outcome: | The proposed framework allows principled, automatic, model-agnostic evaluation of attributions. |
Copied to clipboard
| Challenge: | Language models (LMs) are statistical models trained to assign probability to human-generated text. |
| Approach: | They evaluate language models' ability to reproduce variability that humans exhibit in the ‘next word prediction’ task. |
| Outcome: | The language models are trained to assign probability to human-generated text . they exhibit low calibration to human uncertainty, and advise against it . |
Copied to clipboard
| Challenge: | Multi-task learning (MTL) has become a standard repertoire in natural language processing (NLP) it enables neural networks to learn tasks in parallel while leveraging the benefits of sharing parameters. |
| Approach: | They propose a toolkit for fine-tuning contextualized embeddings in multi-task settings. |
| Outcome: | The proposed toolkit supports a variety of natural language processing tasks . it enables neural networks to learn tasks in parallel while leveraging the benefits of sharing parameters. |
Copied to clipboard
| Challenge: | Recent work has shown large language models are adept at text generation and fine-tuning for downstream NLP tasks. |
| Approach: | They propose a system that generates paraphrased examples in autoregressive fashion using a neural network without the need for techniques such as top-k word selection or beam search. |
| Outcome: | The proposed system generates paraphrased examples in autoregressive fashion without the need for techniques such as top-k word selection or beam search. |
Copied to clipboard
| Challenge: | Large language models (LLMs) perform well on text classification, but their decision strategies need to be better understood. |
| Approach: | They propose an extended rational inattention model that parameterizes linguistic noise and information processing cost and provides an interpretable behavioral framework for black-box LLM classifiers. |
| Outcome: | The proposed model provides an interpretable behavioral framework for black-box LLM classifiers. |
Copied to clipboard
| Challenge: | Domain Adaptation (DA) algorithms suffer degradation when applied to out-of-distribution examples. |
| Approach: | They propose an example-based autoregressive Prompt learning algorithm for on-the-fly Any-Domain Adaptation . the algorithm is trained to generate a unique prompt that maps the test example to a semantic space . |
| Outcome: | The proposed model outperforms baselines in 14 multi-source adaptation scenarios. |
Copied to clipboard
| Challenge: | Question answering (QA) systems have reached human-level accuracy, but they are not robust enough and vulnerable to adversarial examples. |
| Approach: | They modified the attack algorithms widely used in text classification to fit them for QA systems. |
| Outcome: | The proposed framework is the first open-source toolkit for investigating textual adversarial attacks in QA systems. |
Copied to clipboard
| Challenge: | In contrast, adversarial training has been used in computer vision to improve models’ robustness due to the discrete nature of text. |
| Approach: | They propose a way to generate adversarial samples by using pseudo-labeled in-domain text data to train a seq2seq model for adversarials and combine it with paraphrase detection. |
| Outcome: | The proposed model generates realistic and relevant adversarial samples compared to other state-of-the-art models and recovers up to 70% of errors. |
Copied to clipboard
| Challenge: | Adversarial training (AT) has shown strong regularization effects on deep learning algorithms by introducing small input perturbations to improve model robustness. |
| Approach: | They propose to use adversarial training to improve robustness from contextual information in sequence labelling tasks by masking or replacing some words in the sentence. |
| Outcome: | The proposed method shows significant improvements on accuracy and robustness of sequence labelling on CoNLL 2000 and 2003 benchmarks. |
Copied to clipboard
| Challenge: | Flambé is a machine learning experimentation framework built to accelerate the entire research life cycle. |
| Approach: | They propose a framework that allows users to write custom code but include that code as a component in a larger system. |
| Outcome: | The proposed framework enables users to write custom code but include that code as a component in a larger system which is represented by a concise configuration file format. |
Copied to clipboard
| Challenge: | Currently, machine learning is limited in scalability and is limited to specific training data. |
| Approach: | They propose to enhance learning models with world knowledge in the form of Knowledge Graph fact triples for natural language processing tasks. |
| Outcome: | The proposed method is highly scalable to the amount of prior information that has to be processed and can be applied to any generic NLP task. |
Copied to clipboard
| Challenge: | Existing methods for weakly supervised text classification generate pseudo-labels in a context-free manner, thus, the ambiguous, context-dependent nature of human language has been long overlooked. |
| Approach: | They propose a framework that provides contextualized weak supervision for text classification . they leverage contextualized representations of word occurrences and seed word information . |
| Outcome: | The proposed framework provides contextualized weak supervision for text classification . it leverages representations of word occurrences and seed word information to differentiate interpretations . the proposed framework also disambiguates initial seed words, making it fully contextualized . |
Copied to clipboard
| Challenge: | Text-based safety classifiers are widely used for content moderation and increasingly to tune generative language model behavior. |
| Approach: | They propose to use small, targeted datasets to train safety classifiers using small, iterative datasets that can be quickly developed for a particular policy. |
| Outcome: | The proposed method can be quickly developed for a specific policy with a labeled dataset of as few as 80 examples. |
Copied to clipboard
| Challenge: | Existing black-box attacks require thousands of queries on the target model, making them expensive in real-world applications. |
| Approach: | They propose a new approach that guides word substitutions using prior knowledge from the training set to improve the attack efficiency. |
| Outcome: | The proposed approach reduces query-free attack and guided search attacks by a factor of 10 500 . it improves transferability and generalization by the ensemble of the ABPens in NLP . |
Copied to clipboard
| Challenge: | Pre-trained language models (LMs) are state-of-the-art when adapted to text classification tasks. |
| Approach: | They compare fine-tuning, prompting, and knowledge distillation procedures to train pre-trained language models to downstream tasks. |
| Outcome: | The proposed training procedures perform better when trained with fine-tuning or prompting on large train sets than when trained by prompting or fine-untun. |
Copied to clipboard
| Challenge: | XAI has achieved remarkable advances, but few efforts have been devoted to solving the problem. |
| Approach: | They propose a model-agnostic explanation method termed Sparse Contrastive Coding . they use model-based explanations to explain the black-box in a more model-oriented way . |
| Outcome: | The proposed method outperforms five state-of-the-art methods in interpretability and classification metrics. |
Copied to clipboard
| Challenge: | a new study examines the fine-grained classification and classification of climate change-related social media text. |
| Approach: | They propose to use two datasets to analyze climate change-related social media text and propose a fine-grained classification based on the proposed dataset. |
| Outcome: | The proposed datasets are compared with existing datasets and benchmarked using the best-performing model. |
Copied to clipboard
| Challenge: | a recent study shows that item categorization uses the semantic information of the labels to guide the classification task. |
| Approach: | They investigate whether using the semantic information of the labels can improve item categorization systems in e-commerce. |
| Outcome: | The proposed methods improve item categorization performance on a real data set from a major e-commerce company in Japan. |
Copied to clipboard
| Challenge: | Existing natural language learning models fail to continuously learn new tasks as they are re-trained throughout their lifetime. |
| Approach: | They propose a meta-lifelong framework that combines three common lifelong learning principles . they propose to store past examples in episodic memory and replay them at training and inference time . |
| Outcome: | The proposed framework achieves state-of-the-art performance using 1% memory size and narrows the gap with multi-task learning. |
Copied to clipboard
| Challenge: | Recent studies show that attention cannot be considered as a faithful explanation across encoders and tasks. |
| Approach: | They propose a new family of Task-Scaling mechanisms that scale attention weights across tasks and two attention mechanisms. |
| Outcome: | The proposed models improve explanation faithfulness across two attention mechanisms, five encoders and five text classification datasets without sacrificing predictive performance. |
Copied to clipboard
| Challenge: | Various trigger design strategies have been explored to attack text classifiers, however, defending such attacks remains an open problem. |
| Approach: | They propose a backdoor-free training framework that poisons a subset of training data by injecting trigger patterns and setting their labels as the target labels. |
| Outcome: | The proposed framework can detect all the triggers, remove 95% of poisoned training samples with very limited false alarms, and achieve almost the same performance as the models trained on benign training data. |
Copied to clipboard
| Challenge: | skweak is a Python-based toolkit for NLP developers to use weak supervision . labelled data remains a scarce resource in many practical NLP scenarios . |
| Approach: | They present a Python-based toolkit that allows NLP developers to use weak supervision . skweak is designed to facilitate the use of weak supervision for NLP tasks . |
| Outcome: | skweak is a Python-based toolkit that facilitates weak supervision . the toolkit provides a simple interface to apply labels to a large corpus of text data . |
Copied to clipboard
| Challenge: | Existing methods to assess default probabilities are tedious and time-consuming due to the deluge of news coverage for financial institutions. |
| Approach: | They propose a deep learning-powered approach to automate news analysis and credit adverse events detection to score the credit sentiment associated with a company. |
| Outcome: | The proposed system leverages news extraction and data enrichment with targeted sentiment entity recognition to detect companies and text classification to identify credit events. |
Copied to clipboard
| Challenge: | Existing multilingual models for voice assistants are limited by their prohibitive inference time and limited performance. |
| Approach: | They propose to distill and deploy multilingual Transformer models for voice assistants using a teacher-student framework that uses teacher-trained models to supervise student model training. |
| Outcome: | The proposed model outperforms a teacher model trained on unlabelled data and achieves equivalent performance. |
Copied to clipboard
| Challenge: | Various neural networks are designed for text classification on the basis of word embedding, but polysemy is a fundamental feature of the natural language, which brings challenges to text classification. |
| Approach: | They propose to use capsule networks to construct the vectorized representation of semantics and utilize hyperplanes to decompose each capsule to acquire the specific senses. |
| Outcome: | The proposed model extracts more discriminative semantic features and yields significant performance gain compared to baseline methods. |
Copied to clipboard
| Challenge: | Building models of natural language processing (NLP) is challenging in low-resource scenarios where limited data are available. |
| Approach: | They propose a memory imitation meta-learning method that enhances the model’s reliance on support sets for task adaptation. |
| Outcome: | The proposed method outperforms baselines on both text classification and generation tasks. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning text classification models are resource-intensive and require substantial computational power and time. |
| Approach: | They propose a corpus-driven domain mapping pipeline that integrates pre-fine-tuned models from Hugging Face Model Hub into AutoML systems to improve model selection. |
| Outcome: | The proposed pipeline improves model selection and streamlines workflows and reduces computational costs. |
Copied to clipboard
| Challenge: | Feature importance is commonly used to explain machine predictions . however, the consistency of feature importance via different methods remains understudied . |
| Approach: | They compare feature importance from built-in mechanisms and post-hoc methods that approximate model behavior to find similarities between models. |
| Outcome: | The proposed methods show that features from traditional models are more similar with each other than with deep learning models. |
Copied to clipboard
| Challenge: | Existing methods for text classification learn long dependency by deeply stacking or hybrid modeling. |
| Approach: | They propose a global-based local feature extraction architecture with global information incorporated into the local feature extractor. |
| Outcome: | The proposed architecture outperforms the previous best models on eight benchmark datasets. |
Copied to clipboard
| Challenge: | Social media data are longitudinal, usercentered, rich in spontaneous language use. |
| Approach: | They propose a leakage-aware evaluation framework organized around two controlled axes: evidence budget and leakage control. |
| Outcome: | The proposed framework compares graph aggregation with other models using psycholinguistic features and semantic tweet embeddings. |
Copied to clipboard
| Challenge: | Recent advances in NLP have the potential to transform HR processes, from recruitment to employee management. |
| Approach: | They analyze key tasks such as information extraction and text classification and their roles in downstream applications like recommendation and language generation while discussing ethical concerns. |
| Outcome: | The proposed frameworks can be applied to HR tasks and to recommendation, language generation, and interaction. |
Copied to clipboard
| Challenge: | Standard uncertainty sampling assumes that annotating a 500-word document requires the same effort as a 50-word tweet, leading to suboptimal resource allocation when documents vary in length. |
| Approach: | They propose a cost-aware AL variant using logarithmic cost modeling where C(x) is the predicted annotation time for document x and L(x), is its token length. |
| Outcome: | Experiments on ten text classification benchmarks show a 3.3 speedup over BADGE and 3.9 over Entropy sampling to reach F1=0.80, with large effect sizes. |
Copied to clipboard
| Challenge: | Active Learning (AL) allows users to provide focused annotations to integrate human preferences and domain knowledge into machine learning models. |
| Approach: | They propose a counterfactual data augmentation approach inspired by Variation Theory to generate targeted variations along key conceptual dimensions. |
| Outcome: | The proposed approach achieves significantly higher performance when there are fewer annotated data, showing it can address the cold start problem in Active Learning. |
Copied to clipboard
| Challenge: | Existing approaches to text analysis make no assumptions about linguistic structure and focus on stastically frequent patterns. |
| Approach: | They propose a new strategy to visualize linguistic information detected by a CNN for text classification. |
| Outcome: | The proposed strategy automatically encodes complex linguistic patterns on three different languages for each dataset. |
Copied to clipboard
| Challenge: | Modern sentence encoders capture underlying linguistic characteristics of words . Discrete Cosine Transform (DCT) is an efficient alternative to averaging . |
| Approach: | They propose to use a Discrete Cosine Transform to generate universal sentence representations in different languages. |
| Outcome: | The proposed model captures the underlying syntactic characteristics of a given text without compromising practical efficiency. |
Copied to clipboard
| Challenge: | Reinforcement learning fine-tuning methods suffer from inefficient exploration and slow convergence . supervised fine- tuning methods have limited performance ceiling and less solid theoretical foundation . |
| Approach: | They propose a Guess-Think-Answer framework that combines supervised and supervised learning in a unified training paradigm. |
| Outcome: | The proposed framework outperforms both standalone SFT and RL training models on three text classification benchmarks. |
Copied to clipboard
| Challenge: | a recent study shows that parameter-efficient tuning is a challenge for multitask deployments. |
| Approach: | They propose a parameter-efficient tuning technique that only updates a small subset of parameters when adapting a pretrained model to downstream tasks. |
| Outcome: | The proposed method achieves comparable performance to fine-tuning in natural language understanding tasks including text classification and NER with only 0.029% of parameters trained. |
Copied to clipboard
| Challenge: | Discourse structure is integral to understanding a text and is useful in many NLP tasks. |
| Approach: | They propose a structured attention mechanism for text classification that derives a tree over a text, akin to an RST discourse tree. |
| Outcome: | The proposed model improves performance on multiple discourse-relevant tasks and datasets and ablation studies show it does little to capture discourse structure. |
Copied to clipboard
| Challenge: | Existing work on faithfulness evaluation is not conclusive and does not provide a clear answer as to how different methods are to be compared. |
| Approach: | They propose a protocol for faithfulness evaluation that makes use of partially synthetic data to obtain ground truth for feature importance ranking. |
| Outcome: | The proposed method is based on partially synthetic data and is compared with lexical shortcuts on a range of datasets and LSTM models. |
Copied to clipboard
| Challenge: | Existing approaches to text classification assume a fixed set of labels . however, in real-world applications, there exists an infinite label space for describing a given text . |
| Approach: | They propose two new methods that inject aspect-level understanding into pre-trained models at train time to improve zero-shot generalization. |
| Outcome: | The proposed methods improve zero-shot generalization on a set of challenging datasets. |
Copied to clipboard
| Challenge: | Existing approaches to cross-lingual text classification leverage text classifiers trained in a high-resource language to perform text classification in other languages with no or minimal fine-tuning. |
| Approach: | They propose to combine a neural machine translator and a text classifier trained in a high-resource language to perform text classification in other languages with no or minimal fine-tuning. |
| Outcome: | The proposed approach significantly improves over a baseline approach. |
Copied to clipboard
| Challenge: | EHRs contain vast amounts of valuable clinical data, stored as unstructured text. |
| Approach: | They propose a method that uses existing NER+L methods to classify medical entities at scale using a named entity recognition and linking task. |
| Outcome: | The proposed model outperforms Bi-LSTM in minority class tasks with up to 28% of the time and 32% faster training time. |
Copied to clipboard
| Challenge: | State-of-the-art deep neural networks require large amounts of labeled training data that is expensive to obtain or not available for many tasks. |
| Approach: | They propose a weak supervision framework that leverages all available data for a given task . they leverage task-specific unlabeled data through self-training with a model that predicts pseudo-labels for instances that may not be covered by weak rules . |
| Outcome: | The proposed framework improves on state-of-the-art datasets on six benchmark tasks. |
Copied to clipboard
| Challenge: | Recent research has revealed that machine learning models have a tendency to leverage spurious correlations that exist in the training set but may not hold true in general circumstances. |
| Approach: | They propose a metric to detect spurious tokens and a family of regularization methods to mitigate spurious correlations in text classification. |
| Outcome: | The proposed method prevents spurious clusters and significantly improves the robustness of classifiers without auxiliary data. |
Copied to clipboard
| Challenge: | With the emergence of ChatGPT, transformer-only models have significantly advanced text classification and related tasks. |
| Approach: | They propose to use prompt engineering and supervised fine-tuning methods for transformer-based text classification in industrial applications. |
| Outcome: | The proposed models perform well in a variety of industrial scenarios, including email classification, legal document categorization, and the classification of extremely long academic texts. |
Copied to clipboard
| Challenge: | Existing sentence embedding methods lack the ability to capture the implicit semantics of sentences. |
| Approach: | They propose a sentence embedding method that assigns two embeddables to each sentence . one represents the explicit semantics and the other represents the implicit semantics . results show DualCSE can effectively encode both explicit and implicit meanings - they argue . |
| Outcome: | The proposed method can effectively encode both explicit and implicit meanings and improve the performance of the downstream task. |
Copied to clipboard
| Challenge: | Existing methods for text classification using autoregressive language models are limited . authors propose a novel technique for text classification using autoreregressives . |
| Approach: | They propose a two-step technique for text classification using autoregressive language models . they use a set of perplexity and log-likelihood based numeric features to elicit a text instance . |
| Outcome: | The proposed technique eliminates parameter updates in LMs and does not limit training examples . it is evaluated across 5 datasets and compares with multiple competent baselines . |
Copied to clipboard
| Challenge: | Text classification is a primary task in natural language processing (NLP). |
| Approach: | They propose a graph neural network (HINT) that makes full use of hierarchical information contained in the text for the task of text classification. |
| Outcome: | The proposed method outperforms the state-of-the-art methods on popular benchmarks while having a simple structure and few parameters. |
Copied to clipboard
| Challenge: | Despite efforts to adopt digital technologies, the success rate in improving business performance is very low due to the lack of a coherent digital strategy. |
| Approach: | They apply NLP models to earnings calls to understand different clusters of digital strategy patterns that companies are Adopting. |
| Outcome: | The proposed models show that Fortune 500 companies use four distinct strategies which are product-led, customer experience-led and service-led. |
Copied to clipboard
| Challenge: | Existing methods for compressing language representation models are not interpretable and do not consider the differences in the predictive power of various model components or the generalizability of the compressed models. |
| Approach: | They propose a model compression scheme that estimates the average treatment effect of a single layer on the model's predictions. |
| Outcome: | The proposed model compression scheme outperforms strong baselines on dozens of domain pairs across three text classification and sequence tagging tasks. |
Copied to clipboard
| Challenge: | Multilingual transformer language models are used in cross-lingual transfer learning for many NLP tasks such as text classification and named entity recognition. |
| Approach: | They propose a framework that takes the distinction between resource-rich and low-resource language into account and progressively trains from resource-dominated to low-rsource samples. |
| Outcome: | The proposed model outperforms existing methods on low-resource languages and performs well on medium-resourced to high-res languages. |
Copied to clipboard
| Challenge: | Existing methods to explain predictions of deep neural networks are unstable and do not always provide faithful explanations to the target model. |
| Approach: | They propose a method to learn explanations-specific representations while constructing deep network models for text classification. |
| Outcome: | The proposed method improves model interpretability while preserving predictive performance. |
Copied to clipboard
| Challenge: | a new corpus for detecting and linking survey variables is being developed . the corpus is multilingual and includes manually curated word and phrase alignments . |
| Approach: | They propose to create a corpus for the evaluation of detecting and linking survey variables in social science publications. |
| Outcome: | The proposed corpus is the first gold standard for the variable detection and linking task. |
Copied to clipboard
| Challenge: | Recent studies have shown that adversarial examples can be easily fooled by DNNs, making the robustness and security of NLP models significantly important. |
| Approach: | They propose a differential privacy-based algorithm to achieve certified robustness against word substitution at- tacks in text classification via differential privacy. |
| Outcome: | The proposed model achieves higher accuracy and more than 30X efficiency improvement over existing defense algorithms. |
Copied to clipboard
| Challenge: | Several models have been published achieving promising results in all the major linguistic tasks. |
| Approach: | They propose to exploit a BERT-based model to handle multi-turn conversations . they propose to use PuffBot to monitor asthma patients . |
| Outcome: | The proposed model can handle multi-turn conversations, a type of conversations that differs from single-turn by the presence of multiple related interactions. |
Copied to clipboard
| Challenge: | generative large language models (LLMs) are used extensively for text classification in computational social science . conceptualization of categories to classify and using LLM predictions can tempt analysts to skip conceptualization altogether. |
| Approach: | They argue that LLMs can tempt analysts to skip conceptualization altogether . they argue that conceptualization failures induce downstream inferential bias . |
| Outcome: | The proposed model can tempt analysts to skip conceptualization altogether . the proposed model is a first-order concern in the LLM-era . |
Copied to clipboard
| Challenge: | AfriBERTa shows that training transformer models from scratch on 1GB of data from many unrelated African languages outperforms massively multilingual models on downstream NLP tasks. |
| Approach: | They propose that training on smaller amounts of data but from related languages could match the performance of models trained on large, unrelated data. |
| Outcome: | The proposed model outperforms models trained on large, unrelated datasets on downstream NLP tasks. |
Copied to clipboard
| Challenge: | Existing hierarchical classification models are unable to handle large corpora and the number of categories increases with increasing corpus. |
| Approach: | They propose to use external knowledge to introduce a hierarchical neural attention-based classifier to help with the classification of documents. |
| Outcome: | The proposed model performs better than or comparable to state-of-the-art hierarchical models at significantly lower computational cost while maintaining high interpretability. |
Copied to clipboard
| Challenge: | Existing frameworks for text classification employing pre-trained models are constrained by the difficulty of the task. |
| Approach: | They propose a framework which implements a two-stage training strategy to fully exploit the knowledge in pre-trained models. |
| Outcome: | The proposed framework outperforms state-of-the-art classification models on six text classification corpora. |
Copied to clipboard
| Challenge: | Existing methods for few-shot text classification require numerous LMs’ calls to search optimal prompts, thus resulting in overfitting performance and increasing computational cost. |
| Approach: | They propose a multi-scale knowledge prompt-based memory model that extracts instance-level and class-level knowledge and stores them in memory banks during training. |
| Outcome: | Experiments on different benchmarks and parameter analysis demonstrate the effectiveness and efficiency of MuSKPrompt in black-box few-shot text classification tasks. |
Copied to clipboard
| Challenge: | Bangla is a widely spoken yet low-resource language in the NLP literature. |
| Approach: | They propose a BERT-based natural language understanding model pretrainable in Bangla, a widely spoken yet low-resource language in the NLP literature. |
| Outcome: | The proposed model outperforms multilingual and monolingual models on four NLU tasks covering text classification, sequence labeling, and span prediction. |
Copied to clipboard
| Challenge: | Pre-trained transformers are popular in state-of-the-art dialogue generation systems . however, they are vulnerable to adversarial samples crafted by small and imperceptible perturbations. |
| Approach: | They propose a multi-objective attack method that balances two objectives: generation accuracy and length. |
| Outcome: | The proposed method significantly degrades state-of-the-art DG models with a higher success rate than traditional accuracy-based methods. |
Copied to clipboard
| Challenge: | Existing approaches to learning invariant representations rely on the assumption that training and test sets come from the same domain. |
| Approach: | They propose to extend a classification model trained on multiple source domains to an unseen target domain by using key-value memory. |
| Outcome: | The proposed method improves on sentiment analysis and natural language inference tasks. |
Copied to clipboard
| Challenge: | Federated Learning (FL) is a machine learning technique that trains a model across multiple distributed clients holding local data samples, without ever storing client data in a central location. |
| Approach: | They propose to use pretrained models to study three multilingual language tasks . they also examine impact of non-IID text on FL in naturally occurring data . |
| Outcome: | The proposed methods perform better than centralized learning even when using non-IID partitioning. |
Copied to clipboard
| Challenge: | Pre-trained language models suffer from severe miscalibration for both in-distribution and out-of-difference data due to over-parameterization. |
| Approach: | They propose a regularized method to improve in-distribution and out-of-distance calibrations by using on-manifold regularization and off-manfold regularisation. |
| Outcome: | The proposed method outperforms existing methods for text classification in terms of expectation calibration error, misclassification detection, and OOD detection on six datasets. |
Copied to clipboard
| Challenge: | Sentence representations are a critical component in NLP applications such as retrieval, question answering, and text classification. |
| Approach: | They present a systematic review of the literature on sentence representations focusing mostly on deep learning models. |
| Outcome: | The proposed methods highlight the key contributions and challenges in this area and suggest potential avenues for improving the quality and efficiency of sentence representations. |
Copied to clipboard
| Challenge: | Empirically, we show that HyperText outperforms FastText on a range of text classification tasks with much reduced parameters. |
| Approach: | They propose a model that uses hyperbolic geometry to model tree-like hierarchies in natural language sentences by embedding words or ngrams in hyperbolical space. |
| Outcome: | Empirically, the proposed model outperforms FastText on a range of text classification tasks with much reduced parameters. |
Copied to clipboard
| Challenge: | Current text classification approaches focus on the content to be classified, but contextual information is neglected in many cases. |
| Approach: | They propose to integrate contextual information into a transformer-based model by feeding it as natural language input into . they also experiment with different amounts of training data and analyse local discussion networks in a privacy-compliant way. |
| Outcome: | The proposed model can be generalized to other datasets and is privacy-compliant. |
Copied to clipboard
| Challenge: | Masked language modeling is widely adopted, but the process of selecting tokens for masking is random and the percentage of masked tokens is typically fixed for the entire training process. |
| Approach: | They propose to adjust the masking ratio based on a task-informed anti-curriculum learning scheme to mask useful and harmful tokens. |
| Outcome: | The proposed approach improves the ability of the model to focus on key task-relevant features, contributing to statistically significant performance gains across tasks. |
Copied to clipboard
| Challenge: | Uncertainty quantification (UQ) is a prominent approach for eliciting truthful answers from large language models (LLMs). |
| Approach: | They propose to use a well-established method for text generation to extract token embeddings from multiple layers of LLMs and compute MD scores for each token. |
| Outcome: | The proposed method improves on existing methods and provides accurate and computationally efficient uncertainty scores for sequence-level selective generation and claim-level fact-checking tasks. |
Copied to clipboard
| Challenge: | nave multitask pre-finetuning introduces conflicting optimization signals that degrade overall performance. |
| Approach: | They propose a framework that enables a single shared encoder backbone with modular adapters. |
| Outcome: | The proposed framework achieves comparable performance to individual pre-finetuning while meeting practical deployment constraint. |
Copied to clipboard
| Challenge: | Existing methods to optimize tokenizations for downstream tasks are not suitable for traditional NLP. |
| Approach: | They propose a method to explore a tokenization appropriate for a downstream task . they train a model to assign a high probability to such appropriate tokenization based on the downstream task loss . |
| Outcome: | The proposed method improves sentiment analysis and textual entailment tasks . it is also integrated into state-of-the-art contextualized embeddings and reports a positive effect . |
Copied to clipboard
| Challenge: | Text classification is a core task in natural language processing (NLP) Graph neural networks (GNNs) serve as an effective approach for transductive learning. |
| Approach: | They propose a model that combines large scale pretraining and transductive learning for text classification. |
| Outcome: | The proposed model achieves SOTA performance on a wide range of datasets. |
Copied to clipboard
| Challenge: | Current methods for interpolative data augmentation select samples at random, which might make it difficult for the model to generalize better and converge faster. |
| Approach: | They propose a curriculum-based learning method that leverages the relative position of samples in hyperbolic embedding space as a complexity measure to gradually mix up increasingly difficult and diverse samples along training. |
| Outcome: | The proposed method achieves state-of-the-art results over existing methods on 10 benchmark datasets across 4 languages in text classification and named-entity recognition tasks. |
Copied to clipboard
| Challenge: | Existing approaches to interpret neural networks face a trade-off between a model's usefulness and its complexity. |
| Approach: | They propose a novel approach to achieve interpretability that avoids this trade-off by using probability as the central quantity instead of a fixed quantity. |
| Outcome: | The proposed approach outperforms the classical CNN and BiLSTM classifiers on the SST2 and AG-news datasets. |
Copied to clipboard
| Challenge: | Concept-based explanations for large language models are not well understood in text classification. |
| Approach: | They propose a model with a specialized classifier head and activation rate sparsity loss for sentence classification . they compare it to existing models with HI-Concept and ConceptShap . |
| Outcome: | The proposed model improves both the causality and interpretability of the extracted features. |
Copied to clipboard
| Challenge: | a long-running goal of clinical NLP is the extraction of important variables trapped in clinical notes. |
| Approach: | They propose to use large language models to tackle diverse clinical extraction tasks . they propose to reannote existing CASI datasets to compare their models with clinical text. |
| Outcome: | The proposed models outperform existing models on few-shot clinical information extraction tasks. |
Copied to clipboard
| Challenge: | Task-oriented dialog systems need to know when a query falls outside their range of supported intents. |
| Approach: | They propose a dataset that includes queries that are out-of-scope and 150 intent classes over 10 domains. |
| Outcome: | The proposed dataset includes queries that are out-of-scope, i.e., queries that do not fall into any of the system’s supported intents. |
Copied to clipboard
| Challenge: | Existing methods for prompt optimization for language models lack extensibility and search space. |
| Approach: | They propose a method that integrates greedy strategies into optimization with continuous representations to address instability caused by rounding. |
| Outcome: | The proposed approach can improve prompt optimization performance on text classification and attack tasks, as well as models, including GPT-2, OPT, Vicuna, and LLaMA-2. |
Copied to clipboard
| Challenge: | Active learning (AL) aims to reduce labeling costs by querying the examples most beneficial for model learning. |
| Approach: | They propose to query examples most beneficial for model learning by querying data points most informative for labeling. |
| Outcome: | The proposed method reduces labeling costs by querying the examples most beneficial for model learning. |
Copied to clipboard
| Challenge: | Existing methods to mitigate task conflict problem are heuristics or gradient-based algorithms to achieve an arbitrary Pareto optimal trade-off among different tasks . |
| Approach: | They propose a gradient trade-off approach to mitigate the task conflict problem by using heuristics or gradient-based algorithms to achieve an arbitrary Pareto optimal trade- off among different tasks. |
| Outcome: | The proposed model can achieve an arbitrary Pareto optimal trade-off among different tasks near the main objective of multi-task text classification (MTC) it is found that training all tasks simultaneously yields degraded performance than learning them independently, leading to poor training. |
Copied to clipboard
| Challenge: | Argument mining is a challenging analytical task in the rich context of Twitter (now X). |
| Approach: | They propose to optimize the embeddings of the BERTweet transformer for argument mining on Twitter and broader generalization across topics. |
| Outcome: | The proposed approach improves classification and generalization across topics using a siamese network and a dataset. |
Copied to clipboard
| Challenge: | Existing methods to improve text classification performance of pre-trained models have been used to improve their performance. |
| Approach: | They propose a method for improving BERT's performance by using a label embedding technique while keeping almost the same computational cost. |
| Outcome: | The proposed method improves BERT's performance on six text classification benchmark datasets while keeping almost the same computational cost. |
Copied to clipboard
| Challenge: | Recent studies suggest that pre-trained language models have gained rich knowledge during pre-training. |
| Approach: | They propose to tune pre-trained language models with task-specific prompts to improve and stabilize prompttuning. |
| Outcome: | Extensive experiments on zero and few-shot text classification tasks show that prompt-tuning improves and stabilizes prompttun-ing. |
Copied to clipboard
| Challenge: | Existing approaches to text classification are limited by distribution drift and misprediction risk. |
| Approach: | They propose a model risk analysis approach to adapt a pre-trained DNN model to a new dataset given only a small set of representative data. |
| Outcome: | The proposed model performs considerably better than existing approaches on real datasets. |
Copied to clipboard
| Challenge: | Existing approaches to text classification use labels and rationales as ranking constraints. |
| Approach: | They propose a ranking-constrained loss function that combines cross-entropy loss with ranking losses as rationale constraints to speed up deep learning models with limited training data. |
| Outcome: | The proposed approach outperforms baselines on three human-annotated datasets and shows that it is more efficient than existing approaches. |
Copied to clipboard
| Challenge: | ChineseBERT model incorporates glyph and pinyin information of Chinese characters into pretraining . proposed model achieves new performance boost over baseline models with fewer training steps . |
| Approach: | They propose a ChineseBERT model that incorporates glyph and pinyin information into pretraining . the glyph embedding is obtained based on different fonts of a character, and the pinyink embeddment characterizes the pronunciation of Chinese characters. |
| Outcome: | The proposed model achieves new performance boosts over baseline models with fewer training steps. |
Copied to clipboard
| Challenge: | Pretrained language models are used for natural language processing (NLP) but when they are deployed as a service, they can suffer from different attacks . |
| Approach: | They propose two defence strategies to protect the target model from adversarial attacks . they show that model extraction and adversarially transferable attacks can be effective . |
| Outcome: | The extracted model can lead to highly transferable adversarial attacks against the target model. |
Copied to clipboard
| Challenge: | Existing supervised text classifications require a large number of manually labeled documents. |
| Approach: | They develop a pseudo-label based dataless Naive Bayes classifier with seed words . they initialize pseudo-labels for each document using seed word occurrences . |
| Outcome: | The proposed classifier outperforms traditional supervised text classification algorithms with seed words on an imbalanced dataset. |
Copied to clipboard
| Challenge: | Existing sparse attention methods use fixed patterns to select words without considering similarities between words. |
| Approach: | They propose a neural clustering method which integrates into the Self-Attention Mechanism in Transformer and integrates it into the target task. |
| Outcome: | The proposed method outperforms two typical sparse attention methods on translation, text classification, and text matching tasks while having a comparable or even better time and memory efficiency. |
Copied to clipboard
| Challenge: | Fine-tuning suffers from catastrophic forgetting, a problem exacerbated in natural language processing (NLP). |
| Approach: | They propose to use progressive neural networks to re-use previously learned knowledge when learning new tasks. |
| Outcome: | The proposed approach improves on common NLP tasks across a range of architectures, datasets, and tasks. |
Copied to clipboard
| Challenge: | a recent study has investigated how transformer-based language models can be combined with active learning. |
| Approach: | They propose to combine transformer-based language models with active learning to reduce labeling costs . transformers are expensive, but they can be fine-tuned using a query strategy . they compare transformers to experiments from previous research to evaluate their performance . |
| Outcome: | The proposed model outperforms the well-known prediction entropy query strategy on five widely used text classification benchmarks. |
Copied to clipboard
| Challenge: | Experimental results show that heuristic-based active learning methods are limited when the data distribution of the underlying learning problems vary. |
| Approach: | They propose a method that learns an AL "policy" using "imitation learning" they use an efficient "algorithmic expert" which provides the policy learner with good actions in the encountered AL situations. |
| Outcome: | The proposed method is more effective than previous methods on two tasks . labeled data is rare while unlabelled data is abundant . |
Copied to clipboard
| Challenge: | Existing approaches to multi-task learning suffer from the interference between tasks because they lack selection mechanism for feature sharing. |
| Approach: | They propose a multi-task convolutional neural network with the Leaky Unit which has memory and forgetting mechanism to filter the feature flows between tasks. |
| Outcome: | The proposed model can filter feature flows between tasks and improve performance on five datasets. |
Copied to clipboard
| Challenge: | Existing weakly supervised text classification methods require a large number of annotated data and human annotations are expensive. |
| Approach: | They propose to query a masked language model with cloze style prompts to obtain supervision signals. |
| Outcome: | The proposed method outperforms baseline methods on three datasets by 2%, 4%, and 3%. |
Copied to clipboard
| Challenge: | Text classification is one of the most widely studied tasks in natural language processing. |
| Approach: | They propose to use large multilayer neural network models to compose meaning of sentences . they propose to disincentivize focusing on key lexicons to improve classification accuracy . |
| Outcome: | The proposed models learn to compose the meaning of the sentences or focus on key lexicons for classifying the document. |
Copied to clipboard
| Challenge: | Existing few-shot text classification methods lack labeled data in many scenarios. |
| Approach: | They propose a meta learning framework that obtains different learning rates for different tasks and neural network layers to enable the meta learner to quickly adapt to new training data. |
| Outcome: | The proposed framework can obtain different learning rates for different tasks and neural network layers so as to enable the meta learner to quickly adapt to new tasks. |
Copied to clipboard
| Challenge: | Existing models only classify text excerpts as offensive or not, failing to provide information on which words and phrases contribute the most to its offensive tone. |
| Approach: | They propose a model for offensive span detection that uses a pre-trained language model to generate training data. |
| Outcome: | The proposed model can detect offensive spans in a text snippet using a pre-trained language model . the proposed model is able to detect offensive text in simulated training conditions . |
Copied to clipboard
| Challenge: | Electronic medical record (EMR) coding is the process of extracting diagnosis and procedure codes from the digital record (the EMR) pertaining to a patient's visit. |
| Approach: | They propose a neural network architecture that combines ideas from few-shot learning matching networks, multi-label loss functions, and convolutional neural networks for text classification to significantly outperform other state-of-the-art models. |
| Outcome: | The proposed model outperforms existing models on a well known de-identified EMR dataset with multi-label performance measures. |
Copied to clipboard
| Challenge: | ML models assume that training and test data are sampled from the same distribution, but in daily practice, this assumption is often broken. |
| Approach: | They survey articles studying open-set text classification to understand the distribution shifts and mitigation approaches for each problem setup. |
| Outcome: | The proposed methods can solve problems caused by the shifting class distribution in open-set text classification and related tasks. |
Copied to clipboard
| Challenge: | obtaining large amounts of labeled data is expensive. |
| Approach: | They develop a semi-supervised learning framework called FLiText which improves text classification accuracy. |
| Outcome: | The proposed framework improves accuracy of lightweight models on IMDb, Yelp-5, and Yahoo! Answer . the framework improve accuracy by 6.59%, 3.94%, and 3.22% on the datasets of IMDa, Yep-5 and Yahoo. Answer compared with the fully supervised method on the full dataset . |
Copied to clipboard
| Challenge: | Existing text mining models are trained with 0-1 hard label that indicates whether an instance belongs to a class, ignoring rich information of the relevance degree. |
| Approach: | They propose a keyword-based method to automatically generate soft labels from hard labels . they exploit relevance between labels and instances to incorporate them into models . |
| Outcome: | The proposed method improves models under balanced and unbalanced conditions. |
Copied to clipboard
| Challenge: | Xie et al., 2016) demonstrate that semi-supervised learning models suffer from over-fitting when there is only limited labeled data. |
| Approach: | They propose a semi-supervised learning method for text classification using a data augmentation method called TMix. |
| Outcome: | The proposed method outperforms pre-trained and fine-tuned models on several text classification benchmarks. |
Copied to clipboard
| Challenge: | Current text classifiers are subject to adversarial attacks from adversaries, typically executed using machine learning methods. |
| Approach: | They propose a novel and intuitive defense strategy called Sample Shielding that is attacker and classifier agnostic and does not require reconfiguration of the classifier or external resources. |
| Outcome: | The proposed defense is attacker and classifier agnostic and does not require reconfiguration of the classifier or external resources and is simple to implement. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) have been shown effective for zero-shot (0shot) text classification. |
| Approach: | They propose to limit the number of likely labels using a fast base classifier-based conformal predictor calibrated on samples labeled by the 0shot model. |
| Outcome: | The proposed models reduce the average inference time for NLI- and NSP-based models by 25.6% and 22.2% without dropping performance below the predefined error rate of 1%. |
Copied to clipboard
| Challenge: | Recent work shows promising results when prompting pre-trained language models, but in low-resource domains, the domain gap between the pre-training data and the downstream task is too large. |
| Approach: | They propose a method for prompting pre-trained language models using domain-specific keywords with a trainable gated prompt. |
| Outcome: | The proposed prompting method outperforms state-of-the-art prompting methods on three text classification benchmarks and shows that it reduces the need for domain-specific language model pre-training. |
Copied to clipboard
| Challenge: | Recent advances in natural language processing have demonstrated societal bias in existing NLP models. |
| Approach: | They propose to use contrastive learning to learn fair representations for text classification . they conduct experiments on two text datasets to demonstrate their methods are stable . |
| Outcome: | The proposed methods balancing task performance and bias mitigation are stable in different hyperparameter settings. |
Copied to clipboard
| Challenge: | Pretrained language models rely on subword tokenization to process text as a sequence of subwords. |
| Approach: | They propose a character-subword language model that integrates character and subword modalities into one model. |
| Outcome: | The proposed model outperforms its backbone language models on English sequence labeling and classification tasks. |
Copied to clipboard
| Challenge: | Language features are evolving in real-world social media, resulting in deteriorating performance of text classification. |
| Approach: | They propose a model that allows models to adapt to shifted data via latent topic evolution . they use two information bottleneck regularizers to distinguish past and future topics . |
| Outcome: | The proposed model outperforms state-of-the-art models on Twitter on three tasks with 3% of data. |
Copied to clipboard
| Challenge: | Existing ethical and safety considerations for large language models are important for deployment . however, some ethical concerns have been raised due to the presence of private, sensitive, or harmful information in the training data. |
| Approach: | They propose a framework that learns prompt tokens that are prepended to a query to induce unlearning in LLMs. |
| Outcome: | The proposed method improves the trade-off between utility and forgetting for text classification and question-answering. |
Copied to clipboard
| Challenge: | Existing studies have explored multiple aspects that affect the performance of large language models (LLMs) such as input-output mapping, extensive data resources, and the ability to train on labeled examples. |
| Approach: | They propose a framework that injects knowledge into LLMs during continual self-supervised pre-training and judiciously selects examples with high knowledge relevance. |
| Outcome: | The proposed framework outperforms baseline models and improves by more than 13% and 7% on text classification and question-answering tasks. |
Copied to clipboard
| Challenge: | Existing descriptive statistics are inadequate to summarize text collections by quantitative measures. |
| Approach: | They propose a set of characteristic metrics that quantitatively measure the dispersion, sparsity, and uniformity of a text collection. |
| Outcome: | The proposed metrics are highly correlated with text classification performance of a renowned model, which could inspire future applications. |
Copied to clipboard
| Challenge: | Real estate professionals often read tenant reviews to uncover property-related issues that are otherwise difficult to detect. |
| Approach: | They propose to use online tenant reviews to classify properties based on their tenant-perspective view. |
| Outcome: | The proposed method achieves a mean AUROC of 0.965 on 5.5 million tenant reviews and tens of thousands of multifamily properties. |
Copied to clipboard
| Challenge: | Existing continual learning methods focus on preserving knowledge from previous tasks . Continual learning is a useful tool for learning over time, but it is not always possible to generalize to new tasks. |
| Approach: | They propose a disentanglement-based regularization method for continual learning on text classification that disentangles text hidden spaces into generic representations and regularizes them differently to constrain knowledge required to generalize. |
| Outcome: | The proposed method disentangles text hidden spaces into representations that are generic to all tasks and representations specific to each individual task. |
Copied to clipboard
| Challenge: | In this paper, we aim to generate text classification data given arbitrary class definitions . Traditional supervised text classification fine-tunes models on expensive human annotation . |
| Approach: | They propose a framework that can generate text classification data given arbitrary class definitions . they use instruction-to-data mappings and in-context augmentation to refine the framework . |
| Outcome: | The proposed framework outperforms existing methods on benchmarks and training data generation by prompt engineering. |
Copied to clipboard
| Challenge: | ProtoLens provides fine-grained, sub-sentence level interpretability for text classification. |
| Approach: | They propose a prototype-based model that provides fine-grained, sub-sentence level interpretability for text classification. |
| Outcome: | Extensive experiments show that ProtoLens outperforms both prototype-based and non-interpretable baselines on multiple text classification benchmarks. |
Copied to clipboard
| Challenge: | Existing models for document-level language pretraining are not suitable for long documents due to their quadratically increasing memory and time consumption. |
| Approach: | They propose a document-level language pretraining model based on Recurrence Transformers. |
| Outcome: | The proposed model outperforms existing models on language understanding tasks. |
Copied to clipboard
| Challenge: | Prior research has shown the need to consider community language norms when studying taboo text classification and annotations. |
| Approach: | They propose to use special classifiers tuned for each community's language to study bias in taboo classification and annotation where a community perspective is front and center. |
| Outcome: | The proposed method shows that biases are strongest against African Americans and South Asians . a community perspective is front and center in the proposed method . |
Copied to clipboard
| Challenge: | Embeddings compress information into low-dimensional vectors, but can leak private information about sensitive attributes of text. |
| Approach: | They propose a method to privatize embeddings based on homomorphic encryption to prevent leakage of sensitive information in the process of text classification. |
| Outcome: | The proposed method can protect embeddings from leakage while preserving their utility on downstream tasks. |
Copied to clipboard
| Challenge: | Recent years have seen increasing interest in applying natural language processing (NLP) applications to the field of education. |
| Approach: | They propose an NLP-based system that supports german secondary school students in an argumentative writing exercise. |
| Outcome: | The proposed system will support students in a German school exercise . the system will assess similarity between arguments in snippets of argumentative text . |
Copied to clipboard
| Challenge: | Variational Autoencoder (VAE) is widely used to approximate a model’s posterior on latent variables. |
| Approach: | They propose to let the Kullback–Leibler divergence individual follow a distribution across the whole dataset and analyze that it is sufficient to prevent posterior collapse by keeping the expectation of the KL’s distribution positive. |
| Outcome: | The proposed approach can avoid posterior collapse effectively and efficiently without introducing any new model component or modifying the objective. |
Copied to clipboard
| Challenge: | Utilizing language models without internal access is becoming an attractive paradigm in the field of NLP . prompting has shown progressive performance enhancements in situations where data labels are scarce or unavailable. |
| Approach: | They propose a method that uses a weak-supervision signal to train a lightweight model without internal access to data labels. |
| Outcome: | The proposed method improves text classification accuracy with weak-supervision signal without accessing weights or gradients of the LM model or data labels. |
Copied to clipboard
| Challenge: | Weak supervision is a problem in text classification, but it requires corpusspecific knowledge. |
| Approach: | They propose a framework for extremely weak supervision that can be used to train a text classifier. |
| Outcome: | The proposed framework outperforms seed-driven weakly supervised methods on 7 benchmark datasets. |
Copied to clipboard
| Challenge: | Many text classification algorithms depend on the size of the corpus’ vocabulary due to their bag-of-words representation. |
| Approach: | They propose to evaluate how preprocessing techniques affect the run-time of models by evaluating ten techniques over four models and two datasets. |
| Outcome: | The proposed methods can reduce run-time with no loss of accuracy while sacrificing up to 65%. |
Copied to clipboard
| Challenge: | Existing methods for XWS-TC rely on minimal human guidance . X-WS-tc methods require no humanannotated datasets . |
| Approach: | They propose a benchmarking method to compare two approaches to XWS-TC . they use seed-matching and prompting a language model with instructions to decode label words . |
| Outcome: | The proposed methods are more tolerant to human guidance and more robust to model-based methods. |
Copied to clipboard
| Challenge: | a growing interest in exploring how gender bias pertains in contextualized language models has been generated . intrinsic mitigation strategies and bias metrics have been proposed to mitigate gender bias in contextualised language models . |
| Approach: | They propose to use different intrinsic bias mitigation strategies to mitigate gender bias in contextualized language models. |
| Outcome: | The proposed probe shows that some mitigation techniques can hide gender bias . the probe also shows that not all mitigation techniques fool extrinsic bias despite their use . |
Copied to clipboard
| Challenge: | Existing studies studying OOD detection in NLP often rely on external data to diversify model predictions. |
| Approach: | They propose a framework which mimics OOD detection behavior without external data . they take text classification as an archetype and compare them to existing datasets . |
| Outcome: | The proposed framework can resolve in- and out-distribution examples in a natural way using existing datasets. |
Copied to clipboard
| Challenge: | Existing convolutional neural networks (CNNs) use sparse representations of text, such as bag-of-words. |
| Approach: | They propose an adaptive convolution for text classification to give flexibility to convolutional neural networks (CNNs) they attach filter-generating networks to convevolution blocks in existing CNNs . |
| Outcome: | The proposed convolution improves performance in seven benchmark datasets by 2.6 percentage points . the proposed conversions can be likened to players of the twenty questions . |
Copied to clipboard
| Challenge: | Neural networks typically need large labeled data for training and are not easily interpretable. |
| Approach: | They propose a type of recurrent neural networks that combine neural networks and regular expression rules. |
| Outcome: | The proposed recurrent neural networks outperform previous neural approaches in low- and zero-shot scenarios and remain very competitive in rich-resource settings. |
Copied to clipboard
| Challenge: | Word replacement considering length and compositional word replacement are effective word-level perturbations. |
| Approach: | They propose two simple modifications for word-level perturbation: Word Replacement considering Length and Compositional Word Replacement. |
| Outcome: | The proposed methods improve word-level perturbation and classification performance. |
Copied to clipboard
| Challenge: | Existing methods for surfacing symbolic reasoning capabilities are limited to narrow tasks . arithmetic computations are unnatural to perform in pure language space, and hence present difficulties for LLMs. |
| Approach: | They propose a natural language embedded program framework for solving symbolic reasoning tasks. |
| Outcome: | The proposed framework improves on strong baselines across math and symbolic reasoning, text classification, question answering, and instruction following tasks. |
Copied to clipboard
| Challenge: | Neural networks (NNs) are becoming deeper and more complex, making them difficult to understand and interpret. |
| Approach: | They propose a method to distill knowledge concurrently from any neural network architecture for text classification. |
| Outcome: | The proposed method achieves better performance than the target black-box and provides better explanations than existing techniques. |
Copied to clipboard
| Challenge: | Neural network NLP models are vulnerable to small modifications of the input that maintain the original meaning but result in a different prediction. |
| Approach: | They propose to provide a measure of robustness against word substitutions by computing a safe radius for a given input text. |
| Outcome: | The proposed methods are compared with LIME and CNN-Cert and show that they perform well on sentiment analysis and news classification models. |
Copied to clipboard
| Challenge: | a textual classifier must withstand word-level alteration attacks due to inherent vulnerability. |
| Approach: | They propose a formal verification framework with certifiable guarantees on deep neural networks in natural language processing against word-level alteration attacks. |
| Outcome: | The proposed framework provides an approximation of the maximal safe radius with tight bounds . it yields an efficient speed edge and reliable anytime estimation . |
Copied to clipboard
| Challenge: | Existing methods for model ensembles require time, memory, and management effort to perform tasks. |
| Approach: | They propose a method that replicates the effects of a model ensemble with a single model. |
| Outcome: | The proposed method emulates or outperforms a traditional model ensemble with 1/K-times fewer parameters on text classification and sequence labeling tasks. |
Copied to clipboard
| Challenge: | Recent studies have shown promising results of prompt tuning in stimulating pre-trained language models (PLMs) for natural language processing tasks. |
| Approach: | They propose a prompt tuning framework that reformulates NLP tasks into a discriminative language modeling problem. |
| Outcome: | The proposed framework improves on text classification and question answering tasks and prevents unstable tuning problems in low-resource settings. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have revolutionized text classification, but current paradigms rely on output of final layer . implicit internal structures that contribute to LLMs' impressive performance are neglected, forgoing potential performance gains. |
| Approach: | They propose a model-agnostic framework that sparsifies internal neurons of intermediate layers of LLMs for text classification. |
| Outcome: | The proposed framework significantly improves text classification accuracy, efficiency and interpretability. |
Copied to clipboard
| Challenge: | Pretrained language models (PLMs) are used for personalized federated learning . communication costs are high with large PLMs, and local training is expensive . |
| Approach: | They propose a framework for federated learning with pretrained language models . they propose 'discrete local search' and compression mechanism for local training . |
| Outcome: | The proposed framework achieves superior performance compared with baselines. |
Copied to clipboard
| Challenge: | PTLMs can exhibit biases against protected groups in a host of modeling tasks . but, fine-tuned LMs may propagate bias to downstream classifiers . |
| Approach: | They propose to use upstream bias mitigation techniques to reduce bias on downstream tasks by fine-tuning an upstream model and applying it to a downstream model. |
| Outcome: | The proposed model reduces bias on hate speech detection, toxicity detection and coreference resolution tasks over bias factors. |
Copied to clipboard
| Challenge: | Using a neural network, large language models can be trained on multiple tasks, allowing them to perform tasks efficiently. |
| Approach: | They propose a framework that leverages a neural network to select the best dataset combinations for enhancing multi-task learning (MTL) They propose to iteratively refine the selection, greatly improving efficiency while being model-, dataset-, and domain-independent. |
| Outcome: | The proposed framework iteratively refines the selection, greatly improving efficiency, while being model-, dataset-, and domain-independent. |
Copied to clipboard
| Challenge: | Cross-lingual transfer learning (CLTL) is a viable method for building NLP models for a low-resource target language . however, many languages lack the labeled training data necessary for training deep neural nets for varying NLP tasks. |
| Approach: | They propose a cross-lingual transfer learning method that leverages annotated data from other languages to build NLP models for a target language. |
| Outcome: | The proposed model achieves significant performance gains over prior art over multiple text classification and sequence tagging tasks including a large-scale industry dataset. |
Copied to clipboard
| Challenge: | Language models are a key step to achieve state-of-the-art results in many different Natural Language Processing (NLP) tasks. |
| Approach: | They propose to use a language model that is pre-trained on a large and heterogeneous French corpus to train continuous word representations. |
| Outcome: | The proposed model outperforms existing models on a large and heterogeneous French corpus. |
Copied to clipboard
| Challenge: | Existing approaches to improve the performance of natural language processing models are over-parameterized and overfitted. |
| Approach: | They propose an approach to integrate dropout techniques into the training of Transformer models. |
| Outcome: | The proposed approach can achieve 1.5 BLEU improvement on IWSLT14 translation tasks and better accuracy for the classification even using strong pre-trained RoBERTa as backbone. |
Copied to clipboard
| Challenge: | Text classifiers often rely on spurious correlations to predict positive reviews . term Spielberg does not cause the review to be positive, so it does not affect the classification accuracy. |
| Approach: | They propose a method to distinguish spurious and genuine correlations in text classification using treatment effect estimators. |
| Outcome: | The proposed method works well even with limited training examples and is possible to transport the word classifier to new domains. |
Copied to clipboard
| Challenge: | Existing methods for text classification based on large language models are difficult to apply directly to solve. |
| Approach: | They propose a data quality enhancement method to improve LLMs' performance in classification tasks by using a greedy algorithm to select data and then performing fine-tuning. |
| Outcome: | The proposed method improves the performance of large language models in text classification tasks and significantly improves training efficiency, saving nearly half of the training time. |
Copied to clipboard
| Challenge: | Unlike Community Question Answering, where questions are mostly factoid based, forum threads are often open-ended and contain repetitive or irrelevant posts. |
| Approach: | They propose a recurrent neural network-based architecture to model the relevance of a post regarding the original post starting the thread and the novelty it brings to the discussion. |
| Outcome: | The proposed model outperforms the state-of-the-art models for text classification on different types of online forum datasets. |
Copied to clipboard
| Challenge: | Current training data for text classification is limited, resulting in limited generalization capacity. |
| Approach: | They propose a feed-forward network that can generalize from unlabeled parsed corpora to produce task-specific semantic vectors. |
| Outcome: | The proposed approach is especially effective in low-data scenarios compared to state-of-the-art methods. |
Copied to clipboard
| Challenge: | Recent work often tackles the problem of text classification when there is a limited amount of training data. |
| Approach: | They propose a method to generate more helpful augmented data by utilizing the LLM's ability to follow instructions and perform few-shot classifications. |
| Outcome: | The proposed method generates more helpful examples near class boundaries, but generating borderline examples increases the risk of false positives in the dataset. |
Copied to clipboard
| Challenge: | Existing methods for text classification do not assume explicit latent semantic structure of documents, making them less effective and difficult to interpret. |
| Approach: | They propose a model that integrates a topic model into variational graph-auto-encoder to capture hidden semantic information between documents and words. |
| Outcome: | The proposed model outperforms existing models on supervised and semi-supervised text classification and unsupervised representation learning. |
Copied to clipboard
| Challenge: | Recent advances in large language models have revolutionized natural language processing (NLP) there is an urgent need for new benchmarks to keep pace with the development of LLMs. |
| Approach: | They propose a benchmark to assess the capability of large language models (LLMs) they use a dataset to provide both knowledge assessment and application assessment . |
| Outcome: | The proposed benchmark provides datasets tailored for knowledge assessment and application assessment. |
Copied to clipboard
| Challenge: | Recent data augmentation techniques can help to deal with low resource settings, such as BERT, but they can hurt the results. |
| Approach: | They propose a neural approach to automatically learn to generate new examples using a pre-trained sequence-to-sequence model. |
| Outcome: | The proposed approach outperforms existing methods on text classification and natural language inference tasks by 10%. |
Copied to clipboard
| Challenge: | Existing datasets centered around the English language restrict development of Chinese scientific NLP. |
| Approach: | They present a large-scale Chinese scientific literature dataset based on Chinese papers . they use semi-structured data as a natural annotation for many supervised NLP tasks . |
| Outcome: | The proposed dataset can serve as a Chinese corpus and perform many supervised tasks. |
Copied to clipboard
| Challenge: | Recent researches have explored graph neural network (GNN) techniques on text classification, but they are faced with the problems of fixed corpus level graph structure which don’t support online testing and high memory consumption. |
| Approach: | They propose a graph neural network model that builds graphs for each input text with global parameters sharing instead of a single graph for the whole corpus. |
| Outcome: | The proposed model outperforms existing models on several text classification datasets even with consuming less memory. |
Copied to clipboard
| Challenge: | Existing methods for data augmentation do not fully exploit the potential of DA in NLP. |
| Approach: | They propose an easy and plug-in framework for data augmentation to support effective text classification. |
| Outcome: | The proposed framework outperforms existing methods in most cases, but not using agent networks or pre-trained generation networks. |
Copied to clipboard
| Challenge: | Existing studies show that pre-trained multilingual text encoders capture language syntax, helping cross-lingual transfer. |
| Approach: | They provide language syntax and train mBERT to encode universal dependency tree structure. |
| Outcome: | The proposed model improves cross-lingual transfer on PAWS-X and MLQA benchmarks by 1.4 and 1.6 points on average across all languages. |
Copied to clipboard
| Challenge: | Semi-supervised learning (SSL) is a promising technique for improving deep learning models when training data is scarce. |
| Approach: | They propose a semi-supervised learning approach that leverages training dynamics of unlabeled data. |
| Outcome: | The proposed method achieves an average increase in F1 score of 3.5% over baselines in low resource settings. |
Copied to clipboard
| Challenge: | Earlier efforts in text modeling have achieved limited success on word meanings . convolutional neural networks (CNNs) are used to model higher level concepts and facts in texts . |
| Approach: | They propose three strategies to stabilize dynamic routing process to alleviate disturbance of noise capsules. |
| Outcome: | The proposed methods achieve state-of-the-art on 4 out of 6 datasets . they show that capsule networks exhibit significant improvement over baseline methods . |
Copied to clipboard
| Challenge: | Recent studies have used prompt-based fine-tuning methods for text classification tasks . however, the difficulty and costs of manually selecting domain label terms for the verbalizer remain unexplored . |
| Approach: | They propose a framework to automatically retrieve scientific topic-related terms for low-resource text classification tasks. |
| Outcome: | The proposed method outperforms state-of-the-art methods on scientific text classification tasks under few and zero-shot settings. |
Copied to clipboard
| Challenge: | Existing classification models for short texts are weak due to data sparsity . |
| Approach: | They propose topic memory networks for short text classification with a novel topic memory mechanism to encode latent topic representations indicative of class labels. |
| Outcome: | The proposed model outperforms state-of-the-art models on short text classification, while generating coherent topics. |
Copied to clipboard
| Challenge: | Large multi-label datasets contain labels that occur thousands of times (frequent group), those that occur only a few times (few-shot group) and labels that never appear in the training dataset (zero-shot groups). |
| Approach: | They perform a fine-grained evaluation to understand how state-of-the-art methods perform on infrequent labels. |
| Outcome: | The proposed methods improve on two publicly available datasets for multi-label text classification. |
Copied to clipboard
| Challenge: | Continual Learning (CL) is a privacy-preserving machine learning technique that enables collaborative training of ML models by sharing model parameters across distributed clients. |
| Approach: | They propose a framework which selectively combines model parameters of foreign clients to maximize knowledge transfer while preserving privacy. |
| Outcome: | The proposed framework improves the performance of a text classification task using five datasets from diverse domains while preserving privacy. |
Copied to clipboard
| Challenge: | Existing frameworks for large language models (LLMs) generate high-quality synthetic data that can be used to supplement training data or surpass crowd-sourced annotations. |
| Approach: | They propose a framework that iteratively induces rules and generates synthetic data for text classification. |
| Outcome: | The proposed framework outperforms existing models on in-context learning and fine-tuning settings by using augmented data. |
Copied to clipboard
| Challenge: | Experimental results show that pre-trained language models outperform standard prompt learning in zero-shot settings. |
| Approach: | They propose a pipeline for annotating and filtering examples from unlabeled examples . they propose 'model bias validation' method that utilizes unlabed examples as validation set . |
| Outcome: | The proposed approach outperforms standard prompt learning on six text classification tasks. |
Copied to clipboard
| Challenge: | Recent studies show that the flatness of the local minimum correlates well with better generalization. |
| Approach: | They propose to use a method encouraging convergence to a flatter minimum to fine-tune PLMs. |
| Outcome: | The proposed method outperforms state-of-the-art methods on NLP tasks without extra computation cost. |
Copied to clipboard
| Challenge: | A challenge in on-device text classification is to build highly accurate models that fit in small memory footprint and have low latency. |
| Approach: | They propose an on-device neural network which learns compact projection vectors from raw text using structured and context-dependent partition projections. |
| Outcome: | The proposed model outperforms baseline models and surpasses RNN, CNN and BiLSTM models on dialog act and intent prediction. |
Copied to clipboard
| Challenge: | Existing protection methods such as watermarking only work for images but are not applicable to text. |
| Approach: | They propose a technique that injects watermarks into the victim’s prediction probability corresponding to a secret key and is able to detect such a key by probing a suspect model. |
| Outcome: | The proposed technique detects stealing suspects at 100% accuracy on four NLP tasks while the prior method fails on two. |
Copied to clipboard
| Challenge: | Using a poison signature, attackers can manipulate training data to manipulate the target class at test time. |
| Approach: | They propose a backdoor poisoning attack that generates poisoned training samples by poison injection in latent space and a conditional adversarially regularized autoencoder to generate poisones. |
| Outcome: | The proposed attack generates poisoned training samples by poison injection in latent space and shows that the target class can be steered to the poison class with success rates of >80% when the input hypothesis is injected with the poison signature. |
Copied to clipboard
| Challenge: | Existing systems struggle to have consistent long term conversations with the users and fail to build rapport. |
| Approach: | They propose a hierarchical model with self attention for topic spotting . they compare it to previous proposed techniques for topic detection . |
| Outcome: | The proposed model outperforms existing models for topic spotting and deep models for text classification in an online setting. |
Copied to clipboard
| Challenge: | Abstractive text summarization (ATS) requires a long document and short summaries. |
| Approach: | They propose a query strategy for AL in abstractive text summarization that uses uncertainty estimation to reduce model performance. |
| Outcome: | The proposed query strategy improves ROUGE and consistency scores for annotated datasets . it also increases the performance of the model, compared to passive annotation. |
Copied to clipboard
| Challenge: | Recent research has found that text classification datasets contain certain unintended biases, such as text containing demographic identity-terms that are more likely to be abusive. |
| Approach: | They propose a model-agnostic debiasing framework that recovers the non-discrimination distribution using instance weighting, which does not require extra resources or annotations apart from a pre-defined set of demographic identity-terms. |
| Outcome: | The proposed framework alleviates the unintended biases without hurting models’ generalization ability. |
Copied to clipboard
| Challenge: | Existing methods for knowledge distillation focus on direct output alignment, neglecting this crucial structural information. |
| Approach: | They propose a framework for knowledge distillation that maps tokens one-to-one and aligns attention matrix patterns using Centered Kernel Alignment. |
| Outcome: | The proposed framework significantly outperforms existing CTKD baselines. |
Copied to clipboard
| Challenge: | Existing data augmentation methods miss the important characteristic of compositionality, meaning of a complex expression is built from its sub-parts. |
| Approach: | They propose a compositional data augmentation approach for natural language understanding called TreeMix that leverages constituency parsing tree to decompose sentences into constituent sub-structures and the Mixup data enhancing technique to recombine them to generate new sentences. |
| Outcome: | The proposed approach outperforms current state-of-the-art methods on text classification and SCAN. |
Copied to clipboard
| Challenge: | Existing approaches to generating adversarial perturbations scale up the cost of training computational complexity by the number of gradient steps it takes to obtain the adversarials. |
| Approach: | They propose a flood method which aims at better generalization and a criterion to bring hyper-parameter-dependent flooding into effect with a narrowed-down search space by measuring how the gradient steps taken within one epoch affect the loss of each batch. |
| Outcome: | The proposed method improves BERT’s resistance to textual adversarial attacks by a large margin and achieves state-of-the-art robust accuracy on various text classification and GLUE tasks. |
Copied to clipboard
| Challenge: | Multilingual pre-trained language models have demonstrated impressive (zero-shot) cross-lingual transfer abilities, however, their performance is hindered when the target language has distant typology from the source language or when pre-training data is limited in size. |
| Approach: | They propose a method that contextually retrieves prompts as flexible guidance for encoding instances conditionally. |
| Outcome: | The proposed method improves on the XTREME task and also for low-resource languages in unsupervised sentence retrieval. |
Copied to clipboard
| Challenge: | Existing methods for text classification assume that multitask text classification problems are convex multiobjective optimization problems. |
| Approach: | They propose a Tchebycheff procedure to optimize multi-task classification problems without convex assumption. |
| Outcome: | The proposed method is able to find an arbitrary Pareto optimal solution in the PareTO set if the problem is convex, but excludes many Paret optimal solutions from its search scope. |
Copied to clipboard
| Challenge: | Humor recognition datasets contain only English texts and focus on puns. |
| Approach: | They collected a dataset of jokes and funny dialogues in Russian and complemented them carefully with unfunny texts with similar lexical properties. |
| Outcome: | The proposed method is based on the universal language model finetuning and has an F1 score of 0.91 on a test set. |
Copied to clipboard
| Challenge: | XAutoLM is a meta-learning-augmented framework that can be used to optimize discriminative and generative LM fine-tuning pipelines. |
| Approach: | They propose a meta-learning-augmented AutoML framework that reuses past experiences to optimize discriminative and generative LM fine-tuning pipelines efficiently. |
| Outcome: | XAutoLM surpasses zero-shot optimizer’s peak F1 on five of six tasks, reduces mean evaluation time of pipelines by up to 4.5x, and uncovers 50% more pipelines above zero- shot Pareto front. |
Copied to clipboard
| Challenge: | Existing benchmarks for personalization in large language models are understudied . |
| Approach: | They propose a benchmark for training and evaluating language models for producing personalized outputs using a set of seven personalized tasks . they propose two retrieval augmentation approaches that retrieve personal items from each user profile for personalizing language model outputs. |
| Outcome: | The proposed approach is effective for a set of zero-shot and fine-tuned language models and highlights the impact of personalization in various natural language tasks. |
Copied to clipboard
| Challenge: | Recent advances in natural language processing (NLP) have reshaped the industry . complexity of such models makes them a “black box” and can cause ethical concerns . |
| Approach: | They propose a convolutional TM architecture that breaks down text into a sequence of fragments . they propose to use a tokenization scheme to bind the tokens to the text fragments. |
| Outcome: | The proposed architecture improves on a set of text fragments and eliminates the need for a corpus-specific vocabulary. |
Copied to clipboard
| Challenge: | Existing noise learning methods for text classification are underdeveloped . authors propose a noise learning benchmark for text classification . |
| Approach: | They propose to use four state-of-the-art methods of noise learning from the image domain to classify text. |
| Outcome: | The proposed benchmark of noise learning for text classification is based on four methods and five noise modes. |
Copied to clipboard
| Challenge: | Existing methods for ordinal text classification do not incorporate ordinal character into their feedback. |
| Approach: | They propose a new ordinal log-loss loss function that incorporates ordinal character into its feedback. |
| Outcome: | The proposed loss function outperforms state-of-the-art methods on four benchmark text classification datasets. |
Copied to clipboard
| Challenge: | Unsupervised Data Augmentation (UDA) is a semisupervised learning method that penalizes differences between a model's predictions on unlabeled examples and corresponding 'noised' examples produced via data augmentation. |
| Approach: | They propose to use a consistency loss to penalize differences between models' predictions on unlabeled and unlabed examples to enforce consistency between models and their perturbed counterparts. |
| Outcome: | The proposed method is able to penalize differences between models' outputs on unlabeled and unlabed examples without complex data augmentation. |
Copied to clipboard
| Challenge: | Existing methods to improve the robustness of text classification models are token-, sentence-, and hiddenlevel augmentation. |
| Approach: | They propose an interpolation-based data augmentation approach called DoubleMix to improve the robustness of text classification models by learning the “shifted” features in hidden space. |
| Outcome: | The proposed approach outperforms several popular methods on six text classification benchmark datasets and visual analysis shows that the model features are highly interpretable. |
Copied to clipboard
| Challenge: | Continual learning models adapt well to the latest data but lose ability to remember past data due to changes in the data source. |
| Approach: | They propose a hierarchical replay framework that allows models to keep a small memory of previous learned data that uses replay. |
| Outcome: | The proposed model outperforms previous continual learning methods in mitigating catastrophic forgetting. |
Copied to clipboard
| Challenge: | Recent work has exposed the vulnerabilities of neural NLP models, e.g. with small, semantically invariant input alterations. |
| Approach: | They propose to model text classification under synonym replacements or character flip perturbations and then use a formal model verification method to verify its robustness. |
| Outcome: | The proposed models show little difference in terms of nominal accuracy, but have much improved verified accuracy under perturbations and come with an efficiently computable formal guarantee on worst case adversaries. |
Copied to clipboard
| Challenge: | Attention-based models have been claimed to add interpretability, but little is known about the actual relationships between machine and human attention. |
| Approach: | They conduct the first quantitative assessment of human versus computational attention mechanisms for the text classification task. |
| Outcome: | The proposed models are compared against machine attention maps on a publicly available YELP dataset. |
Copied to clipboard
| Challenge: | Roman Urdu is a widely used language in Pakistan but lacks sufficient resources and tools for text-based cybercrime detection. |
| Approach: | They propose to use a benchmark dataset for text-based cybercrime detection in Roman Urdu to improve the performance of pre-trained language models. |
| Outcome: | The proposed model achieves the highest performance on all metrics. |
Copied to clipboard
| Challenge: | Text classification is one of the most fundamental tasks in natural language processing (NLP), but deep neural networks are data-hungry and expensive to train. |
| Approach: | They propose a non-parametric alternative to DNNs that uses a compressor like gzip and a k-nearest-neighbor classifier to achieve competitive results. |
| Outcome: | The proposed method outperforms BERT on all five OOD datasets and outperformed other methods on the few-shot setting. |
Copied to clipboard
| Challenge: | Existing approaches to reduce label noise rely on heuristics and sample losses. |
| Approach: | They propose a method that transfers the noise distribution to a clean set and trains a model to distinguish noisy labels from clean ones using model-based features. |
| Outcome: | Empirically, the proposed approach improves over strong baselines on a wide range of tasks including text classification and speech recognition. |
Copied to clipboard
| Challenge: | Existing subword regularization methods are specialized to a particular tokenizer type. |
| Approach: | They propose a subword regularization method for WordPiece that uses a maximum matching algorithm for tokenization. |
| Outcome: | The proposed method improves the performance of text classification and machine translation tasks as well as other subword regularization methods. |
Copied to clipboard
| Challenge: | Hausa texts are often characterized by writing anomalies such as incorrect character substitutions and spacing errors, which hinder natural language processing (NLP) applications. |
| Approach: | They propose to fine tune transformer-based Hausa-based models to correct writing anomalies by introducing synthetically generated noise to mimic real-world errors. |
| Outcome: | The proposed model improves Hausa text quality and improves other low-resource languages. |
Copied to clipboard
| Challenge: | Recent attempts to improve text classification performance are based on heuristic Chain-of-Thought (CoT) LLMEmbed is a simple and effective transfer learning strategy that can be used to improve the performance of large language models. |
| Approach: | They propose a simple transfer learning strategy to improve text classification using heuristic Chain-of-Thought. |
| Outcome: | The proposed method achieves strong performance on publicly available datasets while using low training overhead. |
Copied to clipboard
| Challenge: | Neural machine translation systems are vulnerable to backdoor attacks . successful backdoors can cause slander, hate speech, phishing, etc. attacks can target very short trigger phrases, which can be challenging to detect even when included verbatim in poisoned instances. |
| Approach: | They propose a method that exploits asymmetry between source and target sentences to detect outlier tokens. |
| Outcome: | The proposed method reduces the success of attacks by up to 89.0% while not affecting predictive accuracy. |
Copied to clipboard
| Challenge: | Existing domain-adaptive pre-training (DAPT) models tend to forget the general knowledge acquired by general PLMs, leading to catastrophic forgetting and sub-optimal performance. |
| Approach: | They propose a framework which augments the domain-specific PLM by a memory built from the frozen general PLM without losing the general knowledge. |
| Outcome: | The proposed framework augments the domain-specific PLM by a memory built from the frozen general PLM without losing the general knowledge. |
Copied to clipboard
| Challenge: | Recent studies reveal the risk of the model stealing attack, posing a financial threat to EaaS providers. |
| Approach: | They propose a dynamic embedding watermarking method that detects watermarks in embedded text . this method is a cross-platform approach that trains a verifier to detect watermark . |
| Outcome: | The proposed method enables an attacker to replicate the proposed method for profit without compromising embedding functionality. |
Copied to clipboard
| Challenge: | Existing models for multi-label classification ignore complexity and dependencies among labels . Experimental results show that our method can obtain more accurate multi-lab classification results. |
| Approach: | They propose a meta-learning method to capture complex label dependencies . they use a Meta-learner to jointly learn the training policies and prediction policies for different labels. |
| Outcome: | The proposed method can capture complex label dependencies on fine-grained entity typing and text classification tasks. |
Copied to clipboard
| Challenge: | Recent advances in natural language processing have demonstrated the efficacy of pre-trained language models for various downstream tasks. |
| Approach: | They compare prompt-based fine-tuning with standard fine-uning for text classification in Urdu and Roman Urdu languages. |
| Outcome: | The proposed approach improves up to 13% in accuracy in low-resource languages with limited labeled examples over standard fine-tuning approaches. |
Copied to clipboard
| Challenge: | Text-based transfer learning techniques can be used to perform downstream tasks. |
| Approach: | They propose to use text-based transfer learning techniques to pre-train a language model in an unsupervised manner and leverage them to perform effective on downstream tasks. |
| Outcome: | The proposed model performs better than task-specific models trained on 3 times as much data and is as effective for language modeling pre-trained on 1/30 of the data. |
Copied to clipboard
| Challenge: | Existing research on the Somali language information retrieval relies on query translation . lack of digital resources is key obstacle to advancing language technologies . |
| Approach: | They develop an annotated corpus for Somali information retrieval using query expansion technique. |
| Outcome: | The proposed corpus comprises 2335 documents collected from well-known online sites . it can be used for text classification-related tasks and question-answering research purposes. |
Copied to clipboard
| Challenge: | Existing methods for text classification use labeled data, but labeles are expensive and difficult to obtain. |
| Approach: | They propose a novel method of data augmentation using the text-generation capabilities of language models. |
| Outcome: | The proposed method improves the current state-of-the-art methods for data augmentation on multi-class datasets. |
Copied to clipboard
| Challenge: | a new text classification framework for large language models addresses the problem of boundary ambiguity and inherent biases in LLMs. |
| Approach: | They propose a two-stage classification framework for large language models to mitigate bottlenecks . their approach uses pairwise comparisons to efficiently narrow down options . |
| Outcome: | The proposed framework reduces the number of options and improves on four datasets. |
Copied to clipboard
| Challenge: | Existing linear transformers suffer from performance degradations on various tasks and corpus. |
| Approach: | They propose a new linear attention that replaces scaling with a normalization to stabilize gradients and confine attention to neighbouring tokens in early layers. |
| Outcome: | The proposed model outperforms vanilla transformers on the long-range arena benchmark while being significantly more space-time efficient. |
Copied to clipboard
| Challenge: | Existing approaches to zero-shot learning are format-agnostic and can address new learning tasks without additional training. |
| Approach: | They propose a new paradigm for zero-shot learning that is format agnostic and compatible with any format and applicable to a list of language tasks. |
| Outcome: | The proposed model shows state-of-the-art performance on several benchmarks and produces satisfactory results on tasks such as text classification and commonsense reasoning. |
Copied to clipboard
| Challenge: | Existing methods for text classification support zero-shot learning but not both . Existing approaches do not support zero or few-shot, and are insufficient for complex classes . |
| Approach: | They propose a method which rapidly adapts from seen classes to new/unseen ones . they use labels and complex class descriptions to perform zero- and few-shot learning . |
| Outcome: | The proposed method beats baselines on complex class descriptions by 22.48% . it also improves zero-shot learning by 4.29% . |
Copied to clipboard
| Challenge: | GE3 is a data augmentation protocol that can be used to increase text examples from one class onto another. |
| Approach: | They propose a data augmentation protocol that extrapolates the hidden space distribution of text examples from one class onto another to investigate whether this bias is valid for data augmented. |
| Outcome: | The proposed protocol improves on three text classification datasets for various data imbalance scenarios. |
Copied to clipboard
| Challenge: | a lack of sufficient training data for some categories can cause imbalanced data distributions . a weak classifier may miscategorize a request, resulting in customer dissatisfaction . |
| Approach: | They propose to use random resampling, word-level transformations and neural text generation to augment existing data to cope with imbalanced data. |
| Outcome: | The proposed methods improve utterance classification results by drawing on utterant variation. |
Copied to clipboard
| Challenge: | low-resource African languages are traditionally left behind because of the lack of well-annotated data and effective preprocessing. |
| Approach: | They propose two news datasets for multi-class classification of news articles in two low-resource African languages. |
| Outcome: | The proposed datasets show that training embeddings on the higher-resourced Kinyarwanda yields successful cross-lingual transfer to Kirundi. |
Copied to clipboard
| Challenge: | Pre-trained language models provide the foundations for state-of-the-art performance across a wide range of natural language processing tasks, including text classification. |
| Approach: | They compare the performance of a linear classifier based on word embeddings with a pre-trained language model, i.e., BERT, across a wide range of datasets and classification tasks. |
| Outcome: | The proposed method outperforms baselines in standard datasets with large training sets, but in settings with small training datasets it performs better. |
Copied to clipboard
| Challenge: | Existing approaches to text clustering fine-tune pre-trained models have been limited. |
| Approach: | They propose a method to fine-tune pre-trained models unsupervisedly for text clustering by learning text representations and cluster assignments using a clustering oriented loss. |
| Outcome: | The proposed model outperforms baseline methods and achieves state-of-the-art results on three text clustering datasets. |
Copied to clipboard
| Challenge: | Sentence representations are essential in many NLP tasks operating at the sentence level. |
| Approach: | They propose an unsupervised sentence representation method to reduce the supervised-unsupervised performance gap for smaller models. |
| Outcome: | The proposed method outperforms supervised training on STS, text classification, and natural language inference tasks on smaller models. |
Copied to clipboard
| Challenge: | Existing work treats labels of each task as independent and meaningless one-hot vectors, which cause a loss of potential label information. |
| Approach: | They propose to combine multi-task learning with semantic vectors to convert labels into vectors . their results are based on extensive experiments on five benchmark datasets based in chinese . |
| Outcome: | The proposed model can improve performance on five benchmark datasets on text classification tasks. |
Copied to clipboard
| Challenge: | generative classifiers exhibit lower sample complexity but higher asymptotic error in simple linear settings, a trade-off that remains unexplored in the transformer era. |
| Approach: | They propose to evaluate generative and discriminative architectures for text classification using a generative model that learns the conditional probability distribution P (y|x) generative models are known to work better in low-data settings, giving rise to the classical 'two regimes' phenomenon for classification. |
| Outcome: | The proposed models show that the classical 'two regimes' manifests distinctly across different architectures and training paradigms. |
Copied to clipboard
| Challenge: | Existing work on pretraining models for text classification uses image encoders instead of visual prompts. |
| Approach: | They propose a method to deploy large-scale pre-trained models in the prompt-tuning paradigm in few-shot learning. |
| Outcome: | The proposed method outperforms the most recent prompt-tuning methods on five public text classification datasets. |
Copied to clipboard
| Challenge: | Using a multi-LLM structure inspired by legal courtroom processes, we demonstrate that it can improve decision-making accuracy in ambiguous text classification scenarios. |
| Approach: | They propose a legal-inspired multi-LLM structure that simulates a courtroom setting within LLMs and assigns roles similar to those of prosecutors, defense attorneys, and judges. |
| Outcome: | The proposed model outperforms both single-LLM classifiers and simpler multi-LLMS setups in ambiguous text classification tasks. |
Copied to clipboard
| Challenge: | Existing studies on adversarial attacks on deep learning models focus on generation of adversarials and defense against adversarial attacks. |
| Approach: | They propose a framework to identify and adjust malicious perturbations and block adversarial attacks for machine learning models. |
| Outcome: | The proposed framework outperforms baseline methods in blocking adversarial attacks for text classification models. |
Copied to clipboard
| Challenge: | a case study combines text classification and legal judgment prediction for flight compensation . a human-in-the-loop model outperformed human prediction when predicting a claim being successful . |
| Approach: | They combine transformer-based classification models with human-in-the-loop data to classify airlines' responses to flight compensation claims. |
| Outcome: | The proposed models outperform human prediction when predicting a legal claim success. |
Copied to clipboard
| Challenge: | Using the Web, we propose a corpus for information extraction and text classification. |
| Approach: | They propose to use a corpus for information extraction and natural language processing (NLP) tasks such as text classification. |
| Outcome: | The proposed corpus can be used for information extraction and natural language processing tasks such as text classification. |
Copied to clipboard
| Challenge: | Recent work has obtained strong zero-shot results by prompting language models. |
| Approach: | They propose a mining-based approach that uses regular expressions to mine labeled examples from unlabeled corpora and fine tune a pretrained model. |
| Outcome: | The proposed method outperforms prompting on a wide range of tasks when using comparable templates. |
Copied to clipboard
| Challenge: | Limiting quantities of training data is considered a key impediment to achieving generalizability in machine learning. |
| Approach: | They examine the impact of training data quality, not quantity, on a model’s generalizability by comparing human-adversarial and human-affable training samples. |
| Outcome: | The proposed model performance improves with 10-30% h-adversarial instances in text classification and relation extraction tasks. |
Copied to clipboard
| Challenge: | Existing approaches to medical text classification are struggling with imbalanced data distribution and rare labels. |
| Approach: | They propose a framework-agnostic algorithm that only utilizes internal label hierarchy in training deep learning models. |
| Outcome: | The proposed approach performs better on public datasets and real-world medical records than existing methods. |
Copied to clipboard
| Challenge: | Pretrained language models often neglect the integration of different scripts within a language, constraining their ability to capture richer semantic information. |
| Approach: | They propose a dual-script enhanced feature representation method for Hindi . they combine features from Devanagari and Romanized Hindi Roberta . |
| Outcome: | The proposed method improves model performance across multiple natural language processing tasks. |
Copied to clipboard
| Challenge: | Recent literature in text classification is biased towards short text sequences . multi-page multi-paragraph documents cannot be efficiently encoded by vanilla transformers based on short text. |
| Approach: | They compare different Transformer-based Long Document Classification approaches to mitigate the computational overhead of vanilla transformers to encode much longer text. |
| Outcome: | The proposed models can process longer text and provide practical advice for long document classification tasks. |
Copied to clipboard
| Challenge: | Existing pre-trained language models are vocabulary-dependent, mapping by default each token to its corresponding embedding. |
| Approach: | They propose a family of vocabulary-independent pre-trained transformers that support unlimited vocabulary . they propose to map each token to its corresponding embedding by default . |
| Outcome: | The proposed models are more memory efficient than existing models while achieving comparable performance on multiple text classification tasks. |
Copied to clipboard
| Challenge: | Existing methods for AD detection are too expensive and time-consuming to cover all potential patients. |
| Approach: | They propose a contrastive learning method to obtain effective text representations based on monolingual embeddings of BERT and a cross-lingual data augmentation method by building autoencoders to learn the text representation shared by both languages. |
| Outcome: | The proposed method outperforms other methods on a Mandarin AD corpus and achieves 81.6% detection accuracy. |
Copied to clipboard
| Challenge: | Existing methods to skip irrelevant words in text processing are slow and vanishing gradients can cause slow inference and a loss of coherence. |
| Approach: | They propose a pointer network-based LSTM framework which can change skip rates during inference. |
| Outcome: | The proposed model is 1.1x3.5x faster than the standard LSTM framework and more accurate than Leap-LSTM at high skip rates. |
Copied to clipboard
| Challenge: | Recent advances in large language models have made it difficult to find appropriate prompts for tasks with multiple input-output formats. |
| Approach: | They propose a prompt tuning method based on reinforcement learning (RL) they propose an anchor model and an extension for generating input-dependent prompts. |
| Outcome: | The proposed method outperforms existing methods on a variety of tasks and achieves State-of-the-art performance across diverse types and sizes of LLMs. |
Copied to clipboard
| Challenge: | Text classification tasks often encounter few-shot scenarios with limited labeled data, and addressing data scarcity is crucial. |
| Approach: | They propose a self-evolution learning (SE) based mixup approach for data augmentation in text classification which generates more adaptive and model-friendly pseudo samples for the model training. |
| Outcome: | The proposed approach can generate more adaptive and model-friendly pseudo samples for the model training. |
Copied to clipboard
| Challenge: | Existing domain adaptation algorithms for text classification are limited by lack of training data and exploiting domain idiosyncrasies to improve performance. |
| Approach: | They propose a domain adaptation layer that learns weights to combine a generic and a specific word embedding into a DA embeddable. |
| Outcome: | The proposed approach improves on binary and multi-class classification tasks using popular encoder architectures. |
Copied to clipboard
| Challenge: | Existing approaches for text classification are lexicallevel features with Naive Bayes or Support Vector Machines (SVM) . |
| Approach: | They propose a deep-learning model that uses label descriptions to train texts and their labels for multi-label and multi-class classification tasks. |
| Outcome: | The proposed model improves on one set with a high margin and on all other sets with competitive results. |
Copied to clipboard
| Challenge: | Existing models for text classification have largely ignored convolution filters and max pooling . text classification is one of the major applications of natural language processing . |
| Approach: | They propose a convolutional attentive recurrent network model which uses convolution filters and max pooling to improve text classification. |
| Outcome: | The proposed model outperforms existing convolutional models on text classification tasks. |
Copied to clipboard
| Challenge: | Existing studies on dialect identification have focused on binary classifications between colloquial Arabic and dialectal Egyptian . |
| Approach: | They propose to use an n-gram based SVM to classify on a fine-grained sub-dialectal level and compare it to methods used in dialect classification such as vocabulary pruning. |
| Outcome: | The proposed method is compared to methods used in dialect classification such as vocabulary pruning of shared items across dialects. |
Copied to clipboard
| Challenge: | specialized embeddings are not available for tasks like entity linking or paragraph classification. |
| Approach: | They evaluate whether universal embeddings can be complemented by specialized embeddables. |
| Outcome: | The proposed embeddings outperform state-of-the-art embeddables without any fine-tuning. |
Copied to clipboard
| Challenge: | Empirically, we show the relative strength of VAMPIRE against computationally expensive contextual embeddings and other popular semi-supervised baselines under low resource settings. |
| Approach: | They propose a lightweight framework for effective text classification when data and computing resources are limited. |
| Outcome: | The proposed framework is compared with expensive contextual embeddings and semi-supervised baselines under low resource settings. |
Copied to clipboard
| Challenge: | Existing studies have focused on the direct use of large language models for text generation and labeling, without fully exploring their potential to comprehend the target task and acquire valuable knowledge. |
| Approach: | They propose to distill the knowledge of large language models into smaller models by generating annotated data. |
| Outcome: | The proposed method improves the performance of small domain models while enhancing the ability of large language models. |
Copied to clipboard
| Challenge: | Graph Neural Networks have been used for text classification, but only in domains with limited data characteristics. |
| Approach: | They compare graph representation methods for text classification using different architectures and setups. |
| Outcome: | The proposed graph representation methods outperform other models in document comprehension tasks. |
Copied to clipboard
| Challenge: | Recent studies have proposed explainable-by-design neural models providing logic explanations for their predictions, but these models favour global explanations, while local ones tend to be noisy and verbose. |
| Approach: | They propose to use LENp to improve local explanations by perturbing input words to improve sensitivity and faithfulness of local explanation. |
| Outcome: | The proposed model provides better local explanations than LIME and is more user-friendly than Lime as attested by a human survey. |
Copied to clipboard
| Challenge: | Existing approaches to NLG are limited by the lack of annotated data. |
| Approach: | They propose to use active learning to reduce the cost of manual annotation to improve annotation efficiency by selecting the most informative examples to label. |
| Outcome: | The proposed approach surpasses baseline of random example selection in some cases but not in others. |
Copied to clipboard
| Challenge: | Increasingly larger datasets have become a standard ingredient to advancing the state-of-the-art in NLP, however, data quality might have already become the bottleneck to unlock further gains. |
| Approach: | They propose a general method for improving model performance in the presence of noisy training data based on self-influence and bandit curriculum learning. |
| Outcome: | The proposed method improves model performance in machine translation, question answering and text classification, building up on approaches to self-influence calculation and automated curriculum learning. |
Copied to clipboard
| Challenge: | Existing approaches to deal with data scarcity are active learning (AL) and pre-trained models are not being considered. |
| Approach: | They propose to use active learning techniques to cope with data scarcity in binary text classification scenarios where the annotation budget is very small and the data is often skewed. |
| Outcome: | The proposed methods improve BERT performance in binary text classification scenarios where the annotation budget is very small and the data is often skewed. |
Copied to clipboard
| Challenge: | Existing methods for text classification based on graph neural networks (GNNs) consider only one-hop neighborhoods and low-frequency information within texts, which suffer from over-smoothing issues if many graph layers are stacked. |
| Approach: | They propose a deep attention diffusion Graph Neural Network model to learn text representations by bridging the chasm of interaction difficulties between a word and its distant neighbors. |
| Outcome: | The proposed model outperforms existing methods on standard benchmark datasets on a set of textual features. |
Copied to clipboard
| Challenge: | Existing research on text classification models ignores the semantic information inherent in labels, treating them as one-hot vectors. |
| Approach: | They propose a model-agnostic method that leverages label semantics and auto detection of hard samples to improve classification accuracy. |
| Outcome: | The proposed method shows significant improvements across different PLMs. |
Copied to clipboard
| Challenge: | Existing black box search methods are inefficient as they do not consider the amount of queries required to generate adversarial attacks. |
| Approach: | They propose a query efficient attack strategy to generate plausible adversarial examples on text classification and entailment tasks. |
| Outcome: | The proposed attack reduces query count by 75% across all datasets and target models compared to prior attacks in a limited query setting. |
Copied to clipboard
| Challenge: | Existing methods to train models without labeled data are lacking in supervised tasks . a lack of labeles is the main obstacle to real-world applications . |
| Approach: | They propose a semi-supervised approach that uses a model to obtain pseudo-labels for unlabeled data. |
| Outcome: | The proposed method outperforms the reproduced methods on four text classification benchmarks. |
Copied to clipboard
| Challenge: | Unlike image or text classification, speech classification tasks are particularly challenging due to the difficulty in capturing the acoustic, semantic, and contextual representations. |
| Approach: | They propose a dataset pruning method that coarsely filters redundant samples using DBSCAN clustering on Mel-Frequency Cepstral Coefficients (MFCC) features. |
| Outcome: | The proposed method achieves 49.5% improvement in WA on the MEAD dataset and 41.9% reduction in EER on speaker identification tasks. |
Copied to clipboard
| Challenge: | Existing adversarial text attacks rely on abundant access to shared internal features and numerous queries, limited to a single task type. |
| Approach: | They propose a black-box attack that exploits the transferability of adversarial texts . they use a deep-level substitute model trained in a plug-and-play manner for text classification . |
| Outcome: | The proposed attack can target multiple tasks with minimal perturbations . it can target commercial APIs, large language models, and image-generation models . |
Copied to clipboard
| Challenge: | Existing explanation methods that generate keywords may be less effective due to missing critical contextual information. |
| Approach: | They propose a new method to generate explanations for possible labels using LLMs and a dialectical prompt. |
| Outcome: | The proposed method significantly improves accuracy and explanation quality over state-of-the-art methods on multiple datasets from diverse domains. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) can capture different levels of concepts in context . previous work on Lao has been hampered by the lack of annotated datasets . |
| Approach: | They construct a text classification dataset to alleviate the resource-scarce situation of Lao . they evaluate them on two downstream tasks: part-of-speech tagging and text classification . |
| Outcome: | The proposed model can capture different levels of concepts in context and generate universal language representations. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained language models fail to yield meaningful results in the few-shot regime. |
| Approach: | They propose a meta-learning-driven low-rank adapter pooling method for leveraging pre-trained language models even with just a few data points. |
| Outcome: | The proposed method outperforms previous few-shot learning methods on five text classification benchmark datasets. |
Copied to clipboard
| Challenge: | Using high-resolution images to overcome the problem of low resolution has never been used in NLP. |
| Approach: | They propose a super-resolution learning method that uses high-res images to overcome the problem of low resolution images. |
| Outcome: | The proposed method is efficient when compared to state-of-the-art methods on several benchmarks datasets in two languages. |
Copied to clipboard
| Challenge: | Recent advances on deep generative models have attracted significant interest in neural topic modeling. |
| Approach: | They propose an adversarial-neural topic model which uses Dirichlet prior to capture the semantic patterns in latent topics. |
| Outcome: | The proposed models outperform competing models on unsupervised/supervised topic modeling and text classification. |
Copied to clipboard
| Challenge: | Language Models often produce overconfident predictions for both in-distribution and out-of-difference samples, i.e., the model’s output probabilities do not match their accuracy. |
| Approach: | They propose a post-hoc approach that changes the confidence scores of a Language Model by leveraging the distance between new samples and the in-domain training set. |
| Outcome: | The proposed approach improves in-domain calibration, robustness to different kind of distribution shift and also the model’s ability to detect out-of-distribution samples. |
Copied to clipboard
| Challenge: | Existing pre-trained language models for hate speech detection are not specialized in implicit hate speech. |
| Approach: | They propose a pre-trained language model for implicit hate speech detection that leverages machine-generated data to train the model. |
| Outcome: | The proposed model can be trained on a massive hate speech dataset with positive samples . it can be generalized and reduce identity term bias, the authors show . |
Copied to clipboard
| Challenge: | Unsupervised cross-lingual transfer is a process of transferring knowledge between languages without explicit supervision. |
| Approach: | They propose a framework that combines lexical and syntactic knowledge to enhance learning . they use a code-switching technique to implicitly teach lexica and a syntaktic-based graph attention network to help encode syntakic structure. |
| Outcome: | The proposed framework outperforms baselines of zero-shot cross-lingual transfer with 1.0 3.7 points on text classification, named entity recognition, and semantic parsing tasks. |
Copied to clipboard
| Challenge: | Experimental results show that PEFT can fine-tune language models without relying on perfectly labeled datasets. |
| Approach: | They propose a framework that decouples sample selection from model training by introducing clean and noisy LoRA. |
| Outcome: | The proposed framework decouples sample selection from model training. |
Copied to clipboard
| Challenge: | Large language models demonstrate cross-lingual transfer capabilities, but these capabilities often fail to extend to low-resource languages, especially those utilizing non-Latin scripts. |
| Approach: | They propose to combine character transliteration with Huffman coding to create a complete transliterations framework that can be extended to other low-resource languages. |
| Outcome: | The proposed framework reduces storage requirements and improves accuracy and accuracy across multiple downstream tasks while maintaining performance on high-resource languages. |
Copied to clipboard
| Challenge: | Existing approaches to generate training data with pre-trained language models have been found effective in various scenarios. |
| Approach: | They propose an unsupervised zero-shot learning method that generates a dataset from scratch and trains a tiny task model under supervision of the synthesized dataset. |
| Outcome: | The proposed method is annotated-free and efficient, but can provide useful insights from the perspective of data-free model-agnostic knowledge distillation and unreferenced text generation evaluation. |
Copied to clipboard
| Challenge: | a recent study focused on intrinsic evaluation, which assesses the quality of summaries, e.g. coherence, fluency, and informativeness, but it focused on task-based extrinsic evaluation to determine the usefulness of summarizations. |
| Approach: | They incorporate three downstream tasks to measure the usefulness of summaries . they find that fine-tuned models produce more useful summary across all three tasks . |
| Outcome: | The proposed model produces more useful summaries across all three tasks compared to zero-shot models . human evaluation provides more reliable performance assessment compared with automatic methods . |
Copied to clipboard
| Challenge: | Large Language Models have shown extraordinary success across text generation tasks . however, their potential for simple yet essential text classification remains underexplored . |
| Approach: | a plug-and-play layer-wise parameter-efficient fine-tuning framework is proposed . it fine- tunes a subset of important LLM layers while freezing redundant ones . |
| Outcome: | a plug-and-play framework fine-tunes a subset of important LLM layers while freezing redundant layers. |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) tasks are becoming more challenging due to the introduction of complex tagsets, which often leads to the failure of existing NER systems in accurately recognizing these entities. |
| Approach: | They propose a novel attack which relies on disentanglement and word attribution techniques to learn an embedding and identifying important words across both components. |
| Outcome: | The proposed approach improves the F1 score over the original LLM model by 8% and 18% on CoNLL-2003 and Ontonotes 5.0 datasets respectively. |
Copied to clipboard
| Challenge: | Existing text classification frameworks require large amounts of human-labeled documents to train . |
| Approach: | They propose a contrastive learning framework that improves zero-shot text classification . they add prompts to enhance label retrieval and use retrieved labels to enrich training . |
| Outcome: | The proposed framework achieves state-of-the-art on four benchmark text classification datasets. |
Copied to clipboard
| Challenge: | Pretrained language models have transformed text classification, but their computational demands often render them impractical for resource-constrained settings. |
| Approach: | They propose a linguistically-grounded framework for context minimization that leverages theme-rheme structure to preserve critical classification signals while reducing input complexity. |
| Outcome: | The proposed framework preserves critical classification signals while reducing input complexity. |
Copied to clipboard
| Challenge: | Existing approaches to pre-trained language models require fine-tuning on labeled datasets or manually constructing proper prompts. |
| Approach: | They propose a nonparametric prompting PLM for fully zero-shot language understanding . they compare it to previous methods for text classification and text entailment . |
| Outcome: | The proposed method outperforms previous methods on diverse tasks. |
Copied to clipboard
| Challenge: | Existing literature demonstrates that compressing deep learning models could affect their fairness. |
| Approach: | They evaluate pruned, distilled, and quantized language models to assess their fairness . they also examine the impact of using multilingual models and evaluation measures . |
| Outcome: | The proposed methods can reduce the fairness of language models by reducing their complexity and reducing the cost of training and deployment. |
Copied to clipboard
| Challenge: | Existing research on text classification models with prompts is limited in scale and lacks understanding of how these methods compare to more established methods. |
| Approach: | They compare the performance of large and smaller language models with prompts to achieve state-of-the-art performance in many NLP tasks. |
| Outcome: | The proposed models outperform the more standard approaches in binary, multiclass, and multilabel tasks in a large scale evaluation of 16 text classification datasets. |
Copied to clipboard
| Challenge: | Existing semi-supervised text classification methods suffer from categorical boundary issues . existing methods suffer by ambiguous categoric boundaries, making it difficult to generate reliable pseudo-labels for each category. |
| Approach: | They propose a semi-supervised framework that assigns pseudo-labels to unlabeled data . they exploit categorical prototypes to assimilate instance representations within the same category . |
| Outcome: | Empirical studies show that the proposed framework is effective . it uses prototypical cluster separation and prototypical-center data selection . |
Copied to clipboard
| Challenge: | Existing studies on the prevalence of mental disorders on the Web are limited to the English language. |
| Approach: | They propose to use user messages posted on Telegram groups to annotate the corpus for natural language processing and to conduct experiments on text classification and regression. |
| Outcome: | The proposed corpus contains over 1,300 subjects with more than 45,000 messages posted in different public Telegram groups. |
Copied to clipboard
| Challenge: | Rapid adoption of LLMs has overshadowed the potential advantages of traditional BERT-like models in text classification. |
| Approach: | They compare BERT-like models fine-tuning, LLM internal state utilization, and LLM zero-shot inference across six datasets. |
| Outcome: | The proposed method outperforms LLMs on six challenging datasets. |
Copied to clipboard
| Challenge: | a dataset of social media texts addressing LGBTQIA+ individuals is presented in this paper . the dataset is based on two sources in italian: Facebook and Twitter . |
| Approach: | They describe a dataset composed of two sub-corpora from two different sources in Italian . the dataset includes social media texts regarding LGBTQIA+ individuals, behaviors, ideology and events . |
| Outcome: | The QUEEREOTYPES dataset includes social media texts regarding LGBTQIA+ individuals, behaviors, ideology and events. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning require caching of intermediate activations to update weights during the backward pass. |
| Approach: | They develop a method to reduce memory usage in fine-tuning of transformers by backpropagating through just a subset of input tokens. |
| Outcome: | The proposed method reduces memory usage and memory footprint on large transformer models . it can be easily combined with existing methods like LoRA, reducing memory cost . |
Copied to clipboard
| Challenge: | Active learning (AL) techniques optimally utilize a labeling budget by iteratively selecting instances that are most valuable for learning. |
| Approach: | They propose to use active learning techniques to iteratively select instances that are most valuable for learning. |
| Outcome: | The proposed framework is used to benchmark active learning techniques for text classification using pre-trained representations. |
Copied to clipboard
| Challenge: | Existing models rely on predictive shortcuts that hold in training data but break under distribution shifts, leading to large performance drops for minority groups. |
| Approach: | They propose a framework that transforms abstract biases into interpretable geometric anchors without auxiliary classifiers by manipulating latent space geometry. |
| Outcome: | The proposed framework outperforms state-of-the-art baselines and improves worst-group accuracy by over 20% on the CivilComments dataset. |
Copied to clipboard
| Challenge: | Using small language models, we challenge the dominance of large models in text classification by prompting. |
| Approach: | They compare the performance of small and large language models in a zero-shot context using different architectures and scoring functions. |
| Outcome: | The proposed model outperforms large models in a zero-shot context. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are expensive to run within a large-scale system and not ideal for low-latency use cases. |
| Approach: | They propose a pipeline that leverages Large Language Models (LLMs) for dataset augmentation. |
| Outcome: | The proposed pipeline improves the performance of a harmful text classification dataset using Large Language Models (LLMs). |
Copied to clipboard
| Challenge: | Existing models for text classification are based on encoder-only transformers and generative pre-trained transformers. |
| Approach: | They propose an uncertainty-aware contrastive sentence embedding approach that addresses language ambiguity and inter-class separability for a text classification task. |
| Outcome: | The proposed approach improves classification accuracy on public datasets compared with state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing evidence for TC under fine-tuning is limited. |
| Approach: | They propose a calibration method that balances the contribution of correct and incorrect predictions within confidence bins. |
| Outcome: | The proposed calibration measures show that the models are overconfident even when miscalibrated . the proposed calibration methods challenge calibration assessment practices and provide a more reliable alternative for evaluating confidence quality in Transformer-based TC. |